제출 #1311142

#제출 시각아이디문제언어결과실행 시간메모리
1311142vanguardSeptember (APIO24_september)C++20
0 / 100
1 ms568 KiB
#include "september.h" #include <bits/stdc++.h> using namespace std; map <int, int > mpp; int cnt = 0; int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) { for (int i = 0; i < N-1; i++) { for (int j = 0; j < M; j++) { mpp[S[j][i]]++; if (mpp[S[j][i]] == M) { mpp.erase(S[j][i]); if(mpp.size()==0)cnt++; } } } return cnt; }
#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...