Submission #592452

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
592452	2022-07-09 08:22:22	proma	Jousting tournament (IOI12_tournament)	C++17	17 / 100	1099 ms	2272 KiB

tournament

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#define see(x) cerr<<#x<<"="<<x<<"\n";
using namespace std;
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
    vector <int> kn;
    int ans = 0, pos = 0;
    for (int i = 0; i < N; i ++) {
        for (int j = 0; j < i; j ++) kn.push_back(K[j]);
        kn.push_back(R);
        for (int j = i; j < N - 1; j ++) kn.push_back(K[j]);
        int cnt = 0;
        for (int j = 0; j < C; j ++) {
//            for (auto i: kn) cout << i << " ";
            int mx = -1;
            for (int k = S[j]; k <= E[j]; k ++) {
                mx = max(mx, kn[k]);
            }
//            see(mx);
            if (mx == R) cnt ++;
            vector <int> tmp;
            for (int k = 0; k < S[j]; k ++) tmp.push_back(kn[k]);
            tmp.push_back(mx);
            for (int k = E[j] + 1; k < int(kn.size()); k ++) tmp.push_back(kn[k]);
            kn.clear();
            for (auto i: tmp) kn.push_back(i);
        }
//        see(cnt);
        if (ans < cnt) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 17 / 17
• Subtask 2: 0 / 32
• Subtask 3: 0 / 51