제출 #1152106

#제출 시각아이디문제언어결과실행 시간메모리
1152106ElayV139월 (APIO24_september)C++20
0 / 100
1 ms324 KiB
#include "september.h" #include <bits/stdc++.h> using namespace std; int solve(int N, int M, vector < int > F, vector < vector < int > > S){ int res = 0; int req = N - 1; for(int i = 0;i <= N - 2;i++) { if(S[0][i] == req){ res++; } req--; } return res; }
#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...