Submission #1206283

#	Time	Username	Problem	Language	Result	Execution time	Memory
1206283		aritro_	September (APIO24_september)	C++20	0 / 100	0 ms	328 KiB

september

#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;
    */
    int ans=1;
    int mn=s[0][0];
    for(int i=0;i<n-1;i++){
        if(mn>s[0][i]){
            mn=s[0][i];
            ans++;
        }
    }
    return ans;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 5
• Subtask 4: 0 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 0 / 9
• Subtask 8: 0 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16