Submission #1201441

#TimeUsernameProblemLanguageResultExecution timeMemory
1201441AI_2512September (APIO24_september)C++20
0 / 100
0 ms320 KiB
#include "september.h" #include <bits/stdc++.h> #define ff first #define ss second using namespace std; int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) { int k = 0; vector<int> mp(N, 0); vector<int> st; int l = 0; for (int i = 0; i< N;i++){ l++; for (int j = 0; j< M;i++){ mp[S[N][M]]++; if (mp[S[N][M]] == M){ st.push_back(S[N][M]); } } 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...