oj.uz

Submission #887634

# Submission time Handle Problem Language Result Execution time Memory
887634 2023-12-14T21:53:02 Z JakobZorz Jousting tournament (IOI12_tournament) C++17
0 / 100
 1000 ms 1580 KB 
#include<vector>
#include<iostream>
using namespace std;
typedef long long ll;

int GetBestPosition(int n,int c,int r,int *K,int *L,int *R){
    for(int i=0;i<c;i++)
        R[i]++;
    vector<int>present(n,1);
    for(int j=0;j<c;j++){
        int sum=0;
        int l=n,r=n;
        for(int i=0;i<n;i++){
            if(sum==L[j]&&l==n)
                l=i;
            if(sum==R[j])
                r=i;
            sum+=present[i];
        }
        L[j]=l;
        R[j]=r;
        for(int i=l;i<r-1;i++)
            present[i]=0;
    }
    
    vector<int>arr_glob(n-1);
    for(int i=0;i<n-1;i++)
        arr_glob[i]=K[i];
    
    int max_res=-1;
    int i_res=0;
    
    for(int ins=0;ins<n;ins++){
        vector<int>arr=arr_glob;
        arr.insert(arr.begin()+ins,r);
        int res=0;
        
        for(int j=0;j<c;j++){
            int m=0;
            for(int i=L[j];i<R[j];i++)
                m=max(m,arr[i]);
            res+=m==r;
        }
        
        //cout<<ins<<" "<<res<<"\n";
        
        if(res>max_res){
            max_res=res;
            i_res=ins;
        }
    }
    
    
    
    return i_res;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

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