#include<bits/stdc++.h>
#include<string.h>
#include <algorithm>
#include <stdlib.h>
#include "september.h"
#define ll long long
using namespace std;
ll k[2001006],a,b,c,d,e,f,m,i,j,n,h,g,l,r,ka,p,q[200005];
map<ll,ll> maa,mii,mee;
vector<ll> vas,vis,vii;
pair<ll,ll> jun,t[200005];
string x;
int solve(int N, int M, vector<int> F,vector<vector<int>> S){
g=0;
for(j=0 ; j<N-1 ; j++){
for(i=0 ; i<M; i++){
if(maa[S[i][j]]==0){
vas.push_back(S[i][j]);
}
maa[S[i][j]]++;
}
h=0;
for(i=0 ; i<vas.size() ; i++){
if(maa[vas[i]]%M==0){
h++;
}
}
if(h==vas.size()){
vas=vii;
g++;
}
}
return N;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |