제출 #432148

#제출 시각아이디문제언어결과실행 시간메모리
432148peuch식물 비교 (IOI20_plants)C++17
0 / 100
1 ms204 KiB
#include "plants.h" #include<bits/stdc++.h> using namespace std; int n; bool sub1; vector<int> esq, dir; void init(int k, vector<int> r) { sub1 = k == 2; n = r.size(); if(sub1){ esq = vector<int> (n); dir = vector<int> (n); int ini; for(ini = 0; ini < n; ini++) if(r[ini] == 1) break; ini++; ini %= n; esq[ini] = 0; for(int i = ini + 1; i != ini; i++, i %= n){ int ant = i - 1; if(ant < 0) ant += n; esq[i] = esq[ant] + 1; if(r[ant] == 1) esq[i] = 0; } for(ini = 0; ini < n; ini++) if(r[ini] == 0) break; dir[ini] = 0; for(int i = (ini + n - 1) % n; i != ini; i += n - 1, i %= n){ int nex = i + 1; if(nex >= n) nex -= n; dir[i] = dir[nex] + 1; if(r[i] == 0) dir[i] = 0; } } return; } int compare_plants(int x, int y) { if(sub1){ if(x + dir[x] >= y) return 1; if(y - esq[y] <= x) return -1; return 0; } 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...