제출 #815441

#제출 시각아이디문제언어결과실행 시간메모리
815441vjudge1Comparing Plants (IOI20_plants)C++17
0 / 100
0 ms212 KiB
#include <iostream> #include <vector> #include "plants.h" using namespace std; int n, h; vector<int> v; void init(int k, vector<int> r) { v = r; n = r.size(); h = k; } int compare_plants(int x, int y) { int z = 0, i; if (h == 2) { for (i = x; i < y; i++) { if (v[i] == 1) z--; else z++; } if (z == y - x) return 1; if (z == x - y) return -1; z = 0; for (i = y; i < x + n; i++) { if (v[i % n] == 1) z--; else z++; } if (z == x - y + n) return 1; if (z == y - x - n) return -1; return 0; } return z; }
#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...