Submission #1135470

#TimeUsernameProblemLanguageResultExecution timeMemory
1135470MunkhturErdenebatSeptember (APIO24_september)C++20
0 / 100
1 ms324 KiB
#include "september.h" #include<bits/stdc++.h> #include<string.h> #include <algorithm> #include <stdlib.h> #define ll int using namespace std; #include <vector> ll i,j; map<ll,ll> maa; int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> s) { ll h=0; ll g=0; for(j=0 ; j<N-1 ; j++){ for(i=0 ; i<M ; i++){ if(maa[s[i][j]]==0){ h++; } maa[s[i][j]]++; if(maa[s[i][j]]==M){ h--; } } if(h==0){ g++; } } return g; }
#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...