Submission #1356730

#TimeUsernameProblemLanguageResultExecution timeMemory
1356730sodooSeptember (APIO24_september)C++20
0 / 100
0 ms836 KiB
#include "september.h"
#include <bits/stdc++.h>
using namespace std;
int solve(int n,int m,vector<int> f,vector<vector<int>> s){
	int ans=0,t=0,mn[100005];
	for (int i=0;i<n-1;i++){
		int ls=t;
		for(int j=0;j<s.size();j++){
			mn[j]=min(mn[j],s[j][i]);
		}
		bool bb=1;
		if(mn[0]!=n-i-1) continue;
		for(int i=1;i<m;i++){
			if(mn[i]!=mn[0]){
				bb=0;
				break;
			}
		}
		if(bb==1) ans++;
	}
	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...