제출 #1239604

#제출 시각아이디문제언어결과실행 시간메모리
1239604Ghulam_Junaid식물 비교 (IOI20_plants)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> #include "plants.h" // #include "grader.cpp" using namespace std; const int N = 2e5 + 100; int n, k, par[N]; vector<int> r; void init(int kk, vector<int> rr) { n = r.size(), k = kk, r = rr; par[2 * n - 1] = 2 * n; for (int i = 2 * n - 2; i >= 0; i --){ if ((r[i % n] == r[(i + 1) % n])) par[i] = par[i + 1]; else par[i] = i + 1; } return; } int compare_plants(int x, int y) { if (x > y) swap(x, y); if (y <= par[x]){ if (r[x]) return -1; return 1; } if (x + n <= par[y]){ if (r[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...