Submission #1173064

#TimeUsernameProblemLanguageResultExecution timeMemory
1173064thecrazycandy9월 (APIO24_september)C++20
5 / 100
1095 ms1924 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;
        int idx = 0, mn = 1e9 + 1;
        for (int j = i + 1; j < n - 1; j++) {
            if (a[0][i] < a[0][j]) {
                ind = max(ind, j);
            }
        }
        cnt++;
        if (ind == 0) continue;
        for (int j = i + 1; j <= ind; j++) {
            if (a[0][i] > a[0][j] && mn > a[0][j]) {
                mn = a[0][j];
                idx = j;
            }
        }
        if (idx == 0) {
            i = ind;
            continue;
        }
        i = idx - 1;
        cnt--;
    }
    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...