제출 #1173012

#제출 시각아이디문제언어결과실행 시간메모리
1173012Robert_junior9월 (APIO24_september)C++17
0 / 100
0 ms524 KiB
#include<bits/stdc++.h>
using namespace std;
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S){
    vector<int>cnt(N);
    int cur = 0;
    int ans = 0;
    int j = 0;
    while(j < N - 1){
        for(int i = 0; i < M; i++){
            cnt[S[i][j]]++;
            if(cnt[S[i][j]] == M) cur++;
        }
        if(cur == j + 1) ans++;
        j++;
    }
    return ans;
}
#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...