Submission #1173049

#TimeUsernameProblemLanguageResultExecution timeMemory
1173049thecrazycandySeptember (APIO24_september)C++20
0 / 100
0 ms332 KiB
#include <bits/stdc++.h>
using namespace std;
int solve (int n, int m, vector <int> v, vector <vector <int>> a) {
    int cnt = 0;
    for (int i = 0; i < n - 1; i++) {
        int ind = 0;
        for (int j = i; j < n - 1; j++) {
            if (a[0][i] < a[0][j]) {
                ind = max(ind, j);
            }
        }
        i = ind;
        cnt++;
        if (ind == 0) break;
    }
    return cnt;
}
#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...