oj.uz

답안 #242240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
242240 2020-06-27T07:22:00 Z dantoh000 마상시합 토너먼트 (IOI12_tournament) C++14
49 / 100
 63 ms 1536 KB 
#include <bits/stdc++.h>
using namespace std;

int l[5005], r[5005], RR[5005];
int in[5005];
int id[5005];
int p[5005];
int sc[5005];
int leftpos[5005];
int T[5005];
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
    for (int i = 0; i < N; i++) {
        in[i] = 1;
    }
    for (int i = 0; i < N-1; i++) K[i] = K[i] > R ? 1:0;
    fill(l,l+5000,-1);
    fill(r,r+5000,-1);
    fill(id,id+5000,-1);
    fill(p,p+5000,-1);
    fill(T,T+5000,-1);
    iota(RR,RR+5000,0);
    for (int i = 0; i < C; i++){
        int cur = 0;
        for (int j = 0; j < N; j++){
            cur += in[j];
            if (cur == S[i]+1 && l[i] == -1) l[i] = j;
            if (cur == E[i]+1 && r[i] == -1) r[i] = RR[j];
        }
        //printf("tourney %d covers <%d,%d>\n",i,l[i],r[i]);
        for (int j = l[i]; j <= r[i]; j++){
            in[j] = 0;
            if (id[j] != -1 && p[id[j]] == -1){
                //printf("setting parent of %d to be %d\n",id[j],i);
                p[id[j]] = i;
            }
            id[j] = i;
            if (T[j] == -1) T[j] = i;
        }
        RR[l[i]] = r[i];
        in[l[i]] = 1;
    }
    for (int i = 0; i < N; i++){
        //printf("%d ",T[i]);
    }
    for (int i = C-1; i >= 0; i--){
        //printf("%d %d\n",l[i],r[i]);
        int mx = 0;
        int LEFT = -1;
        for (int j = l[i]; j < r[i]; j++){
            if (K[j]) mx = 1;
            if (T[j] == i && LEFT == -1) LEFT = j;
        }
        if (mx == 1){
            sc[i] = 0;
        }
        else{
            //printf("will win tourney %d <%d,%d>\n",i,l[i],r[i]);
            for (int j = l[i]; j < r[i]; j++) assert(K[j] != 1);
            if (p[i] == -1) sc[i] = 1;
            else sc[i] = sc[p[i]] + 1;
        }
        leftpos[i] = LEFT;
    }
    for (int i = 0; i < C; i++){
        //printf("parent of tourney %d is tourney %d, leftpos %d\n",i,p[i],leftpos[i]);
    }
    int bestsc = 0;
    int ans = N-1;
    for (int i = 0; i < C; i++){
        //printf("tourney %d has score %d, pos %d\n",i,sc[i],leftpos[i]);
        if (bestsc < sc[i]){
            bestsc = sc[i];
            ans = leftpos[i];
            //printf("tourney %d has score %d, pos %d\n",i,sc[i],leftpos[i]);
        }
        else if (bestsc == sc[i]){
            //printf("tourney %d has score %d, pos %d\n",i,sc[i],leftpos[i]);
            ans = min(ans,leftpos[i]);
        }
    }
  return ans;

}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct

Subtask #2
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 63 ms 512 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 37 ms 512 KB Output is correct
5 Correct 40 ms 512 KB Output is correct
6 Correct 24 ms 512 KB Output is correct
7 Correct 50 ms 512 KB Output is correct
8 Correct 41 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 32 ms 512 KB Output is correct

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 21 ms 1536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -