제출 #1142800

#제출 시각아이디문제언어결과실행 시간메모리
1142800PagodePaivaComparing Plants (IOI20_plants)C++20
0 / 100
32 ms3140 KiB
#include<bits/stdc++.h> #include "plants.h" using namespace std; const int N = 200010; int val[N]; void init(int k, std::vector<int> r) { vector <pair <int, int>> ans; for(int i = 0;i < r.size();i++){ ans.push_back({k-r[i], i}); } sort(ans.begin(), ans.end()); int con = 0; for(auto [_, i] : ans){ val[i] = con; con++; } return; } int compare_plants(int x, int y) { if(val[x] < val[y]) return -1; 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...