# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1050171 | 2024-08-09T07:49:31 Z | mychecksedad | Comparing Plants (IOI20_plants) | C++17 | 1 ms | 360 KB |
#include "plants.h" #include<bits/stdc++.h> using namespace std; #define ll long long int #define pb push_back #define vi vector<int> #define all(x) x.begin(),x.end() const int N = 3e5; int a[N], n; void init(int k, std::vector<int> r) { n = r.size(); for(int i = 0; i < n; ++i) a[i] = 0; if(2*k > n){ int mx = 0; int f = n-1; for(int rep = 0; rep < n; ++rep){ mx = *max_element(all(r)); int l = n, rr = -1; vector<int> L; for(int i = 0; i < n; ++i){ if(r[i] == mx){ L.pb(i); } } int x = L[0]; if(L.size()==1) x = L[0]; else{ for(int i = 0; i + 1 < L.size(); ++i){ if(L[i] + k <= L[i + 1]){ x = L[i + 1]; break; } } } a[x] = f--; r[x] = -n; // cout << x << ' '; // for(int i = x - 1; i > x - k; --i) r[(i+n)%n]--; } // for(int i = 0; i < n; ++i) cout << a[i] << ' '; }else{ } } int compare_plants(int x, int y) { return a[x] < a[y] ? 1 : (a[x] > a[y] ? -1 : 0); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 360 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |