제출 #1339967

#제출 시각아이디문제언어결과실행 시간메모리
1339967yus1f_m9월 (APIO24_september)C++20
0 / 100
1095 ms344 KiB
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "september.h"
using namespace std;
int solve(int n,int m,vector<int>Nums,vector<vector<int>>nums)
{
	int idx=0,ans=0;
	vector<int>res;
	for(int i=n-1;i>=1;i--)
	{
		res.push_back(i);
	}
	for(int i=0;i<nums[0].size();)
	{
		ans++;
		while(idx<res.size() && res[idx]!=nums[0][idx])
		{
			idx++;
		}
		i=idx+1;
	}
	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...