oj.uz

Submission #96743

# Submission time Handle Problem Language Result Execution time Memory
96743 2019-02-11T16:26:45 Z SecretAgent007 Rail (IOI14_rail) C++17
0 / 100
 72 ms 520 KB 
#include "rail.h"
#include <bits/stdc++.h>

void findLocation(int N, int first, int location[], int stype[]){
	stype[0] = 1;
	location[0] = first;
	int stat = 0;
	int maxi = INT_MAX;
	for(int i = 1; i < N; i++){
        if(maxi > getDistance(0,i)){
            maxi = getDistance(0,i);
            stat = i;
        }
	}
	stype[stat] = 2;
	location[stat] = first+maxi;
	for(int i = 1; i < N; i++){
        if(i == stat) continue;
        if(getDistance(0,i) == getDistance(maxi, i)){
            stype[i] = 1;
            location[i] = maxi-getDistance(maxi, i);
        }else{
            stype[i] = 1;
            location[i] = first+getDistance(0,i);
        }
	}

}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 44.0

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