oj.uz

Submission #946050

# Submission time Handle Problem Language Result Execution time Memory
946050 2024-03-14T09:51:50 Z itslq Jousting tournament (IOI12_tournament) C++17
0 / 100
 1000 ms 1496 KB 
#include <bits/stdc++.h>
using namespace std;

int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
    int M, X, ans = 0, ansind = 0;
    vector<int> remaining;
    for (int i = 0; i < N; i++) remaining.push_back(K[i]);

    for (int i = 0; i < N; i++) {
        X = 0;
        vector<int> knights = remaining;
        knights.insert(next(knights.begin(), i), R);

        for (int j = 0; j < C; j++) {
            M = 0;
            for (int k = S[j]; k <= E[j]; k++) M = max(M, knights[k]);
            knights.erase(next(knights.begin(), S[j]), next(knights.begin(), E[j]));
            knights.insert(next(knights.begin(), S[j]), M);
            if (M == R) X++;
        }

        if (X > ans) {
            ans = X;
            ansind = i;
        }
    }

    return ansind;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1014 ms 1496 KB Time limit exceeded
2 Halted 0 ms 0 KB -