Submission #361542

#TimeUsernameProblemLanguageResultExecution timeMemory
361542israeladewuyiOlivander (COCI18_olivander)C++17
50 / 50
1 ms512 KiB
#pragma GCC target ("avx2") #pragma GCC optimization ("O3") #pragma GCC optimization ("unroll-loops") #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<double> vd; typedef vector<string> vs; typedef vector<bool> vb; typedef vector<pair<int,int>> vp; #define int ll #define PB push_back #define pb pop_back #define in inser1t #define endl "\n" #define MP make_pair #define f first #define Trav(a,x) for(auto &a: x) #define sort(x) sort(x.begin(),x.end()); const int MOD = 998244353; const int maxn = 1e5+1; int a,b,c,d,k,n,m,x,s,y,ans; int32_t main(){ ios::sync_with_stdio(0); cin.tie(0); cin>>n; vi A(n); vi B(n); Trav(a,A)cin>>a; sort(A); Trav(a,B)cin>>a; sort(B); int cnt = 0; for(int i = 0; i < n; i++){ if(B[i]>= A[i])cnt++; } cout<<((cnt== n)?"DA": "NE"); return 0; }

Compilation message (stderr)

olivander.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
olivander.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...