oj.uz

Submission #12203

# Submission time Handle Problem Language Result Execution time Memory
12203 2014-12-23T09:14:20 Z qja0950 Rail (IOI14_rail) C++
100 / 100
 161 ms 896 KB 
#include "rail.h"

#include <algorithm>
#include <set>
using namespace std;

#define MAX_N 5005

struct FIRST{
    int dis;
    int p;
}First[MAX_N];
bool operator<(FIRST X, FIRST Y) {
    return X.dis < Y.dis;
}

set<int> C, D;
set<int>::iterator it;

void findLocation(int N, int first, int location[], int stype[])
{
    for(int i=1; i<N; i++) {
        First[i].dis = getDistance(0, i);
        First[i].p   = i;
    }
    sort(First+1, First+N);
    
    stype[0]     = 1;
    location[0]  = first;
    
    int second = First[1].p;
    stype[second]    = 2;
    location[second] = first + First[1].dis;
    
    int leftC = 0, rightD = second;
    C.insert(location[0]);
    D.insert(location[second]);
    
    for(int i=2; i<N; i++) {
        int nowp = First[i].p;
        
        int Second = getDistance(second, nowp);
        
        if(First[i].dis == Second + First[1].dis && location[second] - Second < location[0]) {
            //left;
            int DisC = getDistance(leftC, nowp);
            int positionD = location[leftC] + DisC;
            it = C.lower_bound(positionD); it--;
            int maxC = *it;
            
            if(location[second] - maxC + positionD - maxC == Second) {
                stype[nowp]     = 2;
                location[nowp]  = positionD;
            }else{
                stype[nowp]     = 1;
                location[nowp]  = location[second] - Second;
                leftC = nowp;
                C.insert(location[nowp]);
            }
        }else{
            //right;
            int DisD = getDistance(rightD, nowp);
            int positionC = location[rightD] - DisD;
            it = D.upper_bound(positionC);
            int minD = *it;
            
            if(minD - location[0] + minD - positionC == First[i].dis) {
                stype[nowp]     = 1;
                location[nowp]  = positionC;
            }else{
                stype[nowp]     = 2;
                location[nowp]  = location[0] + First[i].dis;
                rightD = nowp;
                D.insert(location[nowp]);
            }
            
        }
        
        
    }
//    for(int i=0; i<N; i++) printf("[%d %d]\n", stype[i], location[i]);
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 444 KB Output is correct
5 Correct 2 ms 520 KB Output is correct
6 Correct 2 ms 520 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 1 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 624 KB Output is correct
6 Correct 2 ms 628 KB Output is correct
7 Correct 2 ms 636 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 636 KB Output is correct
10 Correct 2 ms 636 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 840 KB Output is correct
2 Correct 97 ms 848 KB Output is correct
3 Correct 84 ms 848 KB Output is correct
4 Correct 87 ms 892 KB Output is correct
5 Correct 88 ms 892 KB Output is correct
6 Correct 91 ms 892 KB Output is correct
7 Correct 92 ms 892 KB Output is correct
8 Correct 92 ms 892 KB Output is correct
9 Correct 86 ms 892 KB Output is correct
10 Correct 89 ms 892 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 892 KB Output is correct
2 Correct 97 ms 892 KB Output is correct
3 Correct 89 ms 892 KB Output is correct
4 Correct 94 ms 892 KB Output is correct
5 Correct 87 ms 892 KB Output is correct
6 Correct 86 ms 892 KB Output is correct
7 Correct 100 ms 892 KB Output is correct
8 Correct 86 ms 892 KB Output is correct
9 Correct 88 ms 892 KB Output is correct
10 Correct 89 ms 892 KB Output is correct
11 Correct 87 ms 892 KB Output is correct
12 Correct 87 ms 892 KB Output is correct
13 Correct 95 ms 892 KB Output is correct
14 Correct 91 ms 892 KB Output is correct
15 Correct 90 ms 892 KB Output is correct
16 Correct 93 ms 892 KB Output is correct
17 Correct 93 ms 892 KB Output is correct
18 Correct 91 ms 892 KB Output is correct
19 Correct 86 ms 896 KB Output is correct
20 Correct 161 ms 896 KB Output is correct