oj.uz

Submission #7542

# Submission time Handle Problem Language Result Execution time Memory
7542 2014-08-10T14:45:07 Z baneling100 Rail (IOI14_rail) C++
30 / 100
 121 ms 820 KB 
#include "rail.h"
#include <algorithm>
#include <vector>

using namespace std;

pair <int,int> A[5000];
vector <int> Up;
vector <int> Down;
int Check[5000];

void findLocation(int N, int First, int location[], int stype[])
{
    int i, j, k, Left, Right, Dist, OK;

    location[0]=First;
    stype[0]=1;
    for(i=1 ; i<N ; i++)
        A[i]=make_pair(getDistance(0,i),i);
    sort(A,A+N);
    location[A[1].second]=location[0]+A[1].first;
    stype[A[1].second]=2;
    for(i=2 ; i<N ; i++)
    {
        Dist=getDistance(A[1].second,A[i].second);
        if(A[i].first==A[1].first+Dist && location[A[1].second]-Dist<location[0])
            Check[A[i].second]=Dist;
    }
    Right=A[1].second;
    Up.push_back(A[1].second);
    for(i=2 ; i<N ; i++)
        if(!Check[A[i].second])
        {
            OK=1;
            Dist=getDistance(Right,A[i].second);
            k=Up.size();
            for(j=0 ; j<k && OK ; j++)
            {
                if(location[Up[j]]-location[0]==(location[Up[j]]-location[0])+(Dist-(location[Right]-location[Up[j]])))
                {
                    location[A[i].second]=location[Right]-Dist;
                    stype[A[i].second]=1;
                    OK=0;
                }
            }
            if(OK)
            {
                location[A[i].second]=location[0]+A[i].first;
                stype[A[i].second]=2;
                Right=A[i].second;
                Up.push_back(A[i].second);
            }
        }
    Left=0;
    Down.push_back(0);
    for(i=2 ; i<N ; i++)
        if(Check[A[i].second])
        {
            OK=1;
            Dist=getDistance(Left,A[i].second);
            k=Down.size();
            for(j=0 ; j<k && OK ; j++)
            {
                if(Check[Down[j]]==(location[A[1].second]-location[Down[j]])+(Dist-(location[Down[j]]-location[Left])))
                {
                    location[A[i].second]=location[Left]-Dist;
                    stype[A[i].second]=2;
                    OK=0;
                }
            }
            if(OK)
            {
                location[A[i].second]=location[A[1].second]-Check[A[i].second];
                stype[A[i].second]=1;
                Left=A[i].second;
                Down.push_back(A[i].second);
            }
        }
}

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 392 KB Output is correct
3 Correct 2 ms 564 KB Output is correct
4 Correct 2 ms 564 KB Output is correct
5 Correct 2 ms 564 KB Output is correct
6 Correct 2 ms 564 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 2 ms 564 KB Output is correct
10 Correct 2 ms 564 KB Output is correct

Subtask #2
22.0 / 22.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 44.0

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