제출 #1206279

#제출 시각아이디문제언어결과실행 시간메모리
1206279aritro_9월 (APIO24_september)C++20
0 / 100
1 ms324 KiB
#include<bits/stdc++.h>
using namespace std;

int solve(int n,int m,vector<int> f,vector<vector<int>> s){
    //subtask 3
    //m=1, line graph
    int ans=0;
    int cur=n-1;
    for(int i=0;i<n-1;i++){
        if(s[0][i]<=cur){
            cur=s[0][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...