oj.uz

답안 #448011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448011 2021-07-28T13:39:16 Z dxz05 마상시합 토너먼트 (IOI12_tournament) C++14
17 / 100
 1000 ms 1740 KB 
#include <bits/stdc++.h>

using namespace std;

int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
    vector<int> ans(N, 0);
    for (int i = 0; i < N; i++){
        vector<int> a;
        a.reserve(N);

        for (int j = 0; j < i; j++) a.push_back(K[j]);
        a.push_back(R);
        for (int j = i; j < N - 1; j++) a.push_back(K[j]);

        for (int it = 0; it < C; it++){
            int mx = 0;
            for (int j = S[it]; j <= E[it]; j++){
                mx = max(mx, a[j]);
            }

            if (mx == R) ans[i]++;

            a[S[it]] = mx;
            a.erase(a.begin() + S[it] + 1, a.begin() + E[it] + 1);

        }

    }

    int pos = max_element(ans.begin(), ans.end()) - ans.begin();

    return pos;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 8 ms 204 KB Output is correct
4 Correct 8 ms 204 KB Output is correct
5 Correct 2 ms 296 KB Output is correct
6 Correct 11 ms 300 KB Output is correct
7 Correct 8 ms 204 KB Output is correct
8 Correct 9 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 2 ms 204 KB Output is correct

Subtask #2
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 300 KB Output is correct
2 Execution timed out 1086 ms 332 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1063 ms 1740 KB Time limit exceeded
2 Halted 0 ms 0 KB -