제출 #1341601

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

typedef long long ll;
#define endl '\n'

#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()

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