Submission #1206292

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