Submission #1294281

#TimeUsernameProblemLanguageResultExecution timeMemory
1294281eri169월 (APIO24_september)C++20
0 / 100
1 ms568 KiB
#include <bits/stdc++.h> using namespace std; int solve(int n, int m, vector<int> v1,vector<vector<int>> v2){ int days=1; for (int i=0; i<n-1; i++){ int ans=1; for (int j=0; j<i; j++){ if (v2[0][j]<v2[0][i]){ ans=0; break; } } for (int j=i+1; j<n-1; j++){ if (v2[0][j]>v2[0][i]){ ans=0; break; } } if (ans==1){days++;} } return days; }
#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...