oj.uz

Submission #19032

# Submission time Handle Problem Language Result Execution time Memory
19032 2016-02-17T06:35:27 Z suhgyuho_william Rail (IOI14_rail) C++
30 / 100
 102 ms 824 KB 
#include "rail.h"
#include <algorithm>
#include <stdio.h>

using namespace std;

int dis0[5010];
int disx[5010];
int bef[5010],next[5010];
int op[5010],num[5010];
bool cmp(int x,int y){
	return dis0[x] < dis0[y];
}
bool cmp2(int x,int y){
	return disx[x] < disx[y];
}

void findLocation(int N, int first, int location[], int stype[]){
	int i,j,k;
	int small,x;
	int t,v,nv;
	int rear,tmp;

	location[0] = first; stype[0] = 1;
	small = 999999999;
    for(i=1; i<N; i++){
		dis0[i] = getDistance(0,i);
		if(small > dis0[i]){
			small = dis0[i];
			x = i;
		}
    }
    location[x] = first+dis0[x];
    stype[x] = 2;
	for(i=1; i<N; i++){
		if(i == x) continue;
		disx[i] = getDistance(x,i);
		if(dis0[i] == dis0[x]+disx[i]) op[i] = 2;
		else op[i] = 1;
	}
	rear = 0;
	for(i=1; i<N; i++){
		if(op[i] == 1){
			rear++;
			num[rear] = i;
		}
	}
	sort(num+1,num+rear+1,cmp);

	for(i=1; i<=rear; i++){
		v = num[i];
        for(j=i-1; j>=1; j--){
			nv = num[j];
			if(stype[nv] == 1) continue;
			if(nv == k) t = tmp = getDistance(k,v);
			else t = tmp-(location[k]-location[nv]);
			if(dis0[nv]+t == dis0[v]){
				stype[v] = 1;
				location[v] = location[nv]-t;
				break;
			}
        }
        if(j == 0){
			stype[v] = 2;
			location[v] = first+dis0[v];
			k = v;
        }
	}
	rear = 0;
	for(i=1; i<N; i++){
		if(op[i] == 2){
			rear++;
			num[rear] = i;
		}
	}
	sort(num+1,num+rear+1,cmp2);
	for(i=1; i<=rear; i++){
		v = num[i];
		for(j=i-1; j>=1; j--){
			nv = num[j];
			if(stype[nv] == 2) continue;
			if(nv == k)	t = tmp = getDistance(nv,v);
			else t = tmp+(location[nv]-location[k]);
			if(disx[v] == disx[nv]+t){
				location[v] = location[nv]+t;
				stype[v] = 2;
				break;
			}
		}
		if(j == 0){
			stype[v] = 1;
			location[v] = location[x]-disx[v];
			k = v;
		}
	}
	//for(i=0; i<N; i++) printf("%d %d\n",stype[i],location[i]);
}

Compilation message

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:33:31: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
     location[x] = first+dis0[x];
                         ~~~~~~^

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 3 ms 512 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 3 ms 592 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 612 KB Output is correct

Subtask #2
22.0 / 22.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 44.0

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