oj.uz

Submission #12202

# Submission time Handle Problem Language Result Execution time Memory
12202 2014-12-23T09:13:04 Z qja0950 Rail (IOI14_rail) C++
30 / 100
 91 ms 720 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] - First[1].dis < 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 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 540 KB Output is correct
7 Correct 2 ms 540 KB Output is correct
8 Correct 2 ms 540 KB Output is correct
9 Correct 2 ms 556 KB Output is correct
10 Correct 2 ms 604 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 2 ms 608 KB Output is correct
5 Correct 2 ms 612 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 3 ms 620 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 636 KB Output is correct

Subtask #3
0 / 26.0

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

Subtask #4
0 / 44.0

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