oj.uz

Submission #38844

# Submission time Handle Problem Language Result Execution time Memory
38844 2018-01-07T07:07:46 Z 14kg Rail (IOI14_rail) C++11
30 / 100
 99 ms 744 KB 
#include "rail.h"
#define N 5000
#define INF 999999999

int n;
int zd[N], zero;
int rd[N], rw, r_num;
int left_num, left;
int right_num, right;

void findLocation(int _n, int _zero, int out1[], int out2[]) {
	int temp = INF;
	n = _n, zero = _zero;

	for (int i = 1; i < n; i++) {
		zd[i] = getDistance(0, i);
		if (temp > zd[i]) {
			temp = zd[i], r_num = i;
			rw = zero + temp;
		}
	}

	for (int i = 1; i < n; i++)
		if (i != r_num) rd[i] = getDistance(r_num, i);

	out1[0] = zero, out2[0] = 1;
	out1[r_num] = rw, out2[r_num] = 2;
	left_num = 0, left = zero;
	right_num = r_num, right = rw;

	for (int i = 1; i <= n; i++)
		if (i != r_num) {
			if (zd[i] + rw - zero == rd[i])
				out1[i] = zero + zd[i], out2[i] = 2;
			else if (rd[i] + rw - zero == zd[i])
				out1[i] = rw - rd[i], out2[i] = 1;

			if (out1[i] && left > out1[i])
				left = out1[i], left_num = i;
			if (out1[i] && right > out1[i])
				right = out1[i], right_num = i;
		}

	for (int i = 1; i <= n; i++)
		if (!out2[i]) {
			temp = getDistance(left_num, i);
			if (left + temp < right)
				out1[i] = left + temp, out2[i] = 2;
			else
				out1[i] = right * 2 - left - temp, out2[i] = 1;
		}
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 484 KB Output is correct
7 Correct 2 ms 520 KB Output is correct
8 Correct 2 ms 536 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 2 ms 724 KB Output is correct

Subtask #2
22.0 / 22.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 44.0

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