Submission #1203642

#TimeUsernameProblemLanguageResultExecution timeMemory
1203642fadyscubeSeptember (APIO24_september)C++20
14 / 100
65 ms2372 KiB
#include "september.h" #include <vector> #include <bits/stdc++.h> using namespace std; int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) { int ans = N-1; for (int j = 0; j < S.size(); j++) { vector<int> v = S[0]; reverse(v.begin(), v.end()); int mx = 0; int k = 0; for (int i = 0; i < v.size(); i++) { mx = max(mx, v[i]); if (mx == i+1) k++; } ans = min(ans, k); } 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...