제출 #946050

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
946050		itslq	마상시합 토너먼트 (IOI12_tournament)	C++17	0 / 100	1014 ms	1496 KiB

tournament

#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
• Subtask 2: 0 / 32
• Subtask 3: 0 / 51