Submission #1206303

#TimeUsernameProblemLanguageResultExecution timeMemory
1206303aritro_September (APIO24_september)C++20
0 / 100
0 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=1;
    for(int i=1;i<n-1;i++){
        if(s[0][i]<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...