제출 #1339972

#제출 시각아이디문제언어결과실행 시간메모리
1339972yusifm9월 (APIO24_september)C++20
14 / 100
77 ms2004 KiB
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "september.h"
const int sz=1000000,INF=1000000000;
using namespace std;
int solve(int n,int m,vector<int>Nums,vector<vector<int>>nums)
{
	int minNum=INF,ans=0;
	for(int i=0;i<nums[0].size();i++)
	{
		minNum=min(minNum,nums[0][i]);
		if(minNum==n-i-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...