oj.uz

Submission #874207

# Submission time Handle Problem Language Result Execution time Memory
874207 2023-11-16T12:48:45 Z Matjaz Jousting tournament (IOI12_tournament) C++14
17 / 100
 1000 ms 1884 KB 
#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;


int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
    vector<int> p(K, K + N - 1);
    p.push_back(R);
    
    int best_position = N;
    int best_wins = 0;
    
    
    for (int tmp=N-1;tmp>=0;tmp--){
        int wins = 0;
        
        vector<int> t(p);
        //int deleted = 0;
        
//        for (int i=0;i<t.size();i++) cout << t[i] << " ";
//        cout << endl;
        
        for (int i=0;i<C;i++){
            int winner = t[S[i]];
            for (int j=S[i];j<=E[i];j++){
                winner = max(winner,t[j]);
            }
            
            if (winner == R) wins++;
//            cout << S[i] << " " << E[i] << endl;
//            cout << "winner: " << winner << endl;
            t[S[i]] = winner;
            for (int j=E[i]+1;j<N;j++){
                t[S[i] + j - E[i]] = t[j];
            }
//            deleted += E[i] - S[i];
//            for (int j=0;j<t.size() - deleted;j++) cout << t[j] << " ";
//            cout << endl;
        }
        
        if (wins >= best_wins){
            best_wins = wins;
            best_position = tmp;
        }
        
        //cout << tmp << " " << wins << endl;
        
        if (tmp > 0) swap(p[tmp-1], p[tmp]);
    }
    
    
    return best_position;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 35 ms 348 KB Output is correct
4 Correct 44 ms 424 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 43 ms 428 KB Output is correct
7 Correct 40 ms 452 KB Output is correct
8 Correct 40 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 7 ms 348 KB Output is correct

Subtask #2
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 348 KB Output is correct
2 Execution timed out 1066 ms 348 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

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