제출 #848266

#제출 시각아이디문제언어결과실행 시간메모리
848266Plurm참나무 (IOI23_beechtree)C++17
5 / 100
53 ms4792 KiB
#include "beechtree.h" #include <bits/stdc++.h> using namespace std; vector<int> beechtree(int N, int M, vector<int> P, vector<int> C) { vector<int> ret; bool ok = true; ret.push_back(1); ret.push_back(1); for (int i = N - 3; i >= 0; i--) { if (C[i + 1] != C[i + 2]) ok = false; if (ok) ret.push_back(1); else ret.push_back(0); } reverse(ret.begin(), ret.end()); 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...