제출 #1038994

#제출 시각아이디문제언어결과실행 시간메모리
1038994ZicrusBeech Tree (IOI23_beechtree)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> #include "beechtree.h" using namespace std; typedef long long ll; vector<int> beechtree(int n, int m, vector<int> p, vector<int> c) { vector<int> res(n); bool works = true; for (int i = n-1; i >= 0; i--) { if (c[i] != c.back()) works = false; res[i] == works; } return res; }

컴파일 시 표준 에러 (stderr) 메시지

beechtree.cpp: In function 'std::vector<int> beechtree(int, int, std::vector<int>, std::vector<int>)':
beechtree.cpp:12:16: warning: value computed is not used [-Wunused-value]
   12 |         res[i] == works;
#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...