제출 #1201450

#제출 시각아이디문제언어결과실행 시간메모리
1201450AI_25129월 (APIO24_september)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h> #define ff first #define ss second using namespace std; int solve(int N, int M, vector<int> F, vector<vector<int>> S) { int k = 0; vector<int> mp(N, 0); vector<int> st; int l = 0; for (int i = 0; i< N-1;i++){ l++; for (int j = 0; j< M;j++){ mp[S[j][i]]++; if (mp[S[j][i]] == M){ st.push_back(S[j][i]); } } if (st.size() == l){ l = 0; k++; st.clear(); } } return k; }
#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...