제출 #1123779

#제출 시각아이디문제언어결과실행 시간메모리
1123779Mousa_Aboubaker9월 (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 n = N, m = M; auto f = F; auto s = S; vector<int> cnt(n + 1, 0); int res = 0; int curr = 0; for(int i = 0; i < n - 1; i++) { for(int j = 0; j < m; j++) { if(cnt[s[j][i]] == 0) curr++; cnt[s[j][i]]++; if(cnt[s[j][i]] == m) curr--; } res += curr == 0; } 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...