Submission #1047633

#TimeUsernameProblemLanguageResultExecution timeMemory
1047633idasComparing Plants (IOI20_plants)C++11
0 / 100
29 ms4436 KiB
#include "plants.h" #include "bits/stdc++.h" #define FOR(i, begin, end) for(int i=(begin); i<(end); i++) #define sz(x) ((int)((x).size())) using namespace std; typedef long long ll; typedef vector<int> vi; const int MxN=2e5+10; int n, r[MxN]; void init(int k, std::vector<int> R) { n=sz(R); FOR(i, 0, n) r[i]=R[i]; } int compare_plants(int x, int y) { if(r[x]<r[y]) return 1; if(r[x]>r[y]) return -1; return 0; }
#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...