Submission #1198536

#TimeUsernameProblemLanguageResultExecution timeMemory
1198536tkm_algorithmsComparing Plants (IOI20_plants)C++20
0 / 100
0 ms328 KiB
/** * In the name of Allah * We are nothing and you're everything **/ #include <bits/stdc++.h> //#include "plants.h" using namespace std; using ll = long long; #define all(x) begin(x), end(x) #define sz(x) (int)(x).size() const char nl = '\n'; const int N = 1e5+10; vector<int> r, p; int n; void init(int k, vector<int> R) { r = R, n = sz(R); p.resize(n); for (int i = 0; i < n; ++i)p[i] = r[i]+(i>0?p[i-1]:0); } int compare_plants(int x, int y) { int sum = (p[y-1]-(x >0?p[x-1]:0)); int len = y-x+1; if (sum == len-1)return -1; if (x == 0 && y == n-1) { if (r[y] == 1)return 1; } return 0; } //void solve() { //init(2, {0, 1, 0, 1}); //cout << compare_plants(0, 3); //} //int32_t main() { //ios::sync_with_stdio(0); //cin.tie(0); //solve(); //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...