Task: | Sorting |
Sender: | MAKMED1337 |
Submission time: | 2021-01-30 19:32:15 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#2 | WRONG ANSWER | 0.01 s | 2 | details |
#3 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#4 | WRONG ANSWER | 0.01 s | 1, 2 | details |
Code
#include <bits/stdc++.h>#include <climits>using namespace std;template<class T>using V = vector<T>;template<class T>using VV = V<V<T>>;using ld = long double;#define ll long longusing ull = unsigned ll;using PLL = pair<ll, ll>;using VLL = V<ll>;using VB = V<bool>;using VVB = VV<bool>;using VVLL = VV<ll>;using Gr = VVLL;using MLL = map<ll, ll>;#define UMLL unordered_map<ll, ll, custom_hash>//using int128 = __int128;//using double128 = __float128;#define fast ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); cerr.tie(nullptr);#define INF LONG_MAX#define MINF LONG_MIN#define R &#define CR const R#define FORI(i, a, b) for(ll i = a, max##i = b; i < max##i; ++i)#define FOR(i, n) FORI(i, 0, n)#define RFORI(i, a, b) for(ll i = a, min##i = b; i >= min##i; --i)#define RFOR(i, n) RFORI(i, n, 0)#define FORA(i, a) for(auto i : a)#define FORAR(i, a) for(auto R i : a)#define FORACR(i, a) for(auto CR i : a)#define ALL(obj) begin(obj), end(obj)#define Count(q) while(q--)#define OK cerr << "OK\n";#define mp make_pair#define pb push_back//#define DEBUGtemplate<class T>T sqr(T x){return x * x;}void YES(bool g, ostream R os, bool upper = true){if(g)if(upper)os << "YES";elseos << "Yes";elseif(upper)os << "NO";elseos << "No";os << "\n";}template<class T>void show(T CR t, ostream R os = cerr){FORACR(i, t)os << i << " ";os << "\n";}template<class T>void show2d(T CR t, ostream R os = cerr){FORACR(i, t)show(i, os);os << "\n";}constexpr ll MOD = 1e9 + 7;//constexpr ll len = 2e5 + 100;constexpr ld PI = atanl(1.0L) * 4;struct custom_hash{static uint64_t splitmix64(uint64_t x){x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator() (uint64_t x) const{static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};//arrvoid init() {}void solve(istream R is, ostream R os){ll n;is >> n;VLL a(n);FORAR(i, a)is >> i;if(n <= 3){YES(is_sorted(ALL(a)), os);return;}if(n == 4){bool g = is_sorted(ALL(a));g |= a[0] == 3 && a[1] == 4 && a[2] == 1 && a[3] == 2;YES(g, os);return;}YES(1, os);}void tester(istream R is, ostream R os){fastinit();ll q = 1;is >> q;os << setprecision(999);Count(q)solve(is, os);}int main(){//ifstream in("input.txt");//ofstream out("output.txt");tester(cin, cout);}
Test details
Test 1
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
153 1 1 2 1 2 ... |
correct output |
---|
YES YES NO NO NO ... |
user output |
---|
YES YES NO NO NO ... Truncated |
Test 2
Group: 2
Verdict: WRONG ANSWER
input |
---|
1000 59 35 29 32 50 11 15 9 21 19 45 2... |
correct output |
---|
YES NO YES NO YES ... |
user output |
---|
YES YES YES YES YES ... Truncated |
Test 3
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
720 6 1 6 4 5 2 3 6 6 3 2 1 5 4 ... |
correct output |
---|
YES NO NO NO YES ... |
user output |
---|
YES YES YES YES YES ... Truncated |
Test 4
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 8 7 4 2 8 6 3 5 1 8 3 8 2 7 5 4 6 1 ... |
correct output |
---|
NO NO YES NO YES ... |
user output |
---|
YES YES YES YES YES ... Truncated |