oj.uz

Submission #946059

# Submission time Handle Problem Language Result Execution time Memory
946059 2024-03-14T09:54:05 Z thelegendary08 Jousting tournament (IOI12_tournament) C++14
0 / 100
 26 ms 2692 KB 
#include<bits/stdc++.h>
using namespace std;
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
    vector<int>v;
    for(int i = 0;i<N-1;i++)v.push_back(K[i]);
    int ans = 0;
    for(int i = 0;i<N;i++){
        int cur = 0;
        vector<int>w = v;
        w.insert(v.begin() + i, R);
        for(int j = 0;j<C;j++){
            int mx = *max_element(w.begin() + S[j], w.begin() + E[j]);
            if(mx == R)cur++;
            for(int k = S[j];k<=E[j];k++){
                if(w[k] != mx)w.erase(w.begin() + k);
            }
        }
        ans = max(ans, cur);
    }
    return ans;



}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 32.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Runtime error 26 ms 2692 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -