oj.uz

Submission #290214

# Submission time Handle Problem Language Result Execution time Memory
290214 2020-09-03T13:46:37 Z AaronNaidu Rail (IOI14_rail) C++14
30 / 100
 82 ms 504 KB 
#include <bits/stdc++.h>
#include "rail.h"
using namespace std;

int distFrom0[20000];
int distFromMin[20000];

void findLocation(int n, int first, int location[], int sType[]) {
    location[0] = first;
    sType[0] = 1;
    int minDist = 1000000007;
    int minIndex = -1;
    for (int i = 1; i < n; i++)
    {
        distFrom0[i] = getDistance(0, i);
        if (distFrom0[i] < minDist)
        {
            minDist = distFrom0[i];
            minIndex = i;
        }
    }
    location[minIndex] = distFrom0[minIndex] + first;
    sType[minIndex] = 2;
    for (int i = 0; i < n; i++)
    {
        if (i != 0 and i != minIndex)
        {
            distFromMin[i] = getDistance(minIndex, i);
            if (distFromMin[i] > distFrom0[i])
            {
                sType[i] = 2;
                location[i] = first + distFrom0[i];
            }
            else
            {
                sType[i] = 1;
                location[i] = location[minIndex] - distFromMin[i];
            }
        }
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #3
0 / 26.0

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

Subtask #4
0 / 44.0

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