제출 #848264

#제출 시각아이디문제언어결과실행 시간메모리
848264Plurm참나무 (IOI23_beechtree)C++17
0 / 100
2029 ms3880 KiB
#include "beechtree.h" std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C) { std::vector<int> ret; for (int i = 0; i < N; i++) { bool ok = true; for (int j = i + 1; j < N; j++) { if (C[j] != C[i + 1]) ok = false; } if (ok) ret.push_back(1); else ret.push_back(0); } return ret; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...