oj.uz

Submission #41090

# Submission time Handle Problem Language Result Execution time Memory
41090 2018-02-12T15:12:13 Z comtalyst Race (IOI11_race) C++14
43 / 100
 774 ms 73456 KB 
/*
 *	Task: ioi11_race
 *	Lang: C/C++11
 *	Site: oj.uz
 *	Last Update: 12/2/2018
 */

#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
using namespace std;

/* Note
----------------------------
Learned : 
Bugs found & solved :
Optimizations :
----------------------------
*/	

#define x first
#define y second
#define umap unordered_map
#define pqueue priority_queue
#define mset multiset
#define mp make_pair
#define mt make_tuple
#define long long long
#define MOD 1000000007
#define MAX (long)(1e16+5)
#define MIN (long)(-1e16-5)
#define FILEIN_ freopen("__in.txt","r",stdin)
#define FILEOUT_ freopen("__out.txt","w",stdout)
#define FILEIN(text) freopen(text,"r",stdin)
#define FILEOUT(text) freopen(text,"w",stdout)

//long tmp[200005][2],tmp2[200005];

vector<pair<long,long>> adl[200005];
umap<long,long> s[200005];
long ls[200005],sid[200005],lv[200005],sc,n,m,mn=MAX;
void solve(long x,long f){
	long i,y,id,v,need,w;
	pair<long,long> mx={0,0};
	lv[x] = lv[f]+1;
	for(i = 0; i < adl[x].size(); i++){
		y = adl[x][i].x;
		if(y == f) continue;
		solve(y,x);
		id = sid[y];
		mx = max(mx,{s[id].size(),y});
	}
//	printf(">>>>>>>>> %lld from %lld\n",x,f);
	if(mx.x){
		sid[x] = sid[mx.y];
	}
	else{
		sid[x] = ++sc;
		mx.y = 0;
	}
	for(i = 0; i < adl[x].size(); i++){
		y = adl[x][i].x;
		if(y == f || y == mx.y) continue;
		id = sid[y];
		while(!s[id].empty()){
			v = (*s[id].begin()).x + ls[id];
			need = m-v-ls[sid[x]];
//			printf(":: %lld\n",v);
			if(s[sid[x]][need]){
//				printf("<<<<< %lld\n",s[sid[x]][need]+(*s[id].begin()).y-lv[x]*2);
				mn = min(mn,s[sid[x]][need]+(*s[id].begin()).y-lv[x]*2);
			}
			else{
				s[sid[x]].erase(need);
			}
			if(s[sid[x]][v-ls[sid[x]]]){
				s[sid[x]][v-ls[sid[x]]] = min(s[sid[x]][v-ls[sid[x]]],(*s[id].begin()).y);
			}
			else{
				s[sid[x]][v-ls[sid[x]]] = (*s[id].begin()).y;
			}
			s[id].erase(s[id].begin());
		}
	}
	for(i = 0; i < adl[x].size(); i++){
		y = adl[x][i].x;
		w = adl[x][i].y;
		if(y == f){
			break;
		}
	}
	need = m-w-ls[sid[x]];
	if(s[sid[x]][need]){
		mn = min(mn,s[sid[x]][need]-lv[f]);
	}
	else{
		s[sid[x]].erase(need);
	}
	ls[sid[x]] += w;
	s[sid[x]][w - ls[sid[x]]] = lv[x];
}

long best_path(int _n,int _m,int _edl[][2],int _edw[]){			// f*ck you 0-based idx
	long i,j;

	n = _n;
	m = _m;
	for(i = 0; i < n-1; i++){
		adl[_edl[i][0]+1].emplace_back(_edl[i][1]+1,_edw[i]);
		adl[_edl[i][1]+1].emplace_back(_edl[i][0]+1,_edw[i]);
		if(_edw[i] == m){
			return 1;
		}
	}
	solve(1,0);
	if(mn != MAX){
		return mn;
	}
	else{
		return -1;
	}
}

/*main(){
	long t,i,j,k,_n,_m;
	
	scanf("%lld %lld",&_n,&_m);
	for(i = 0; i < _n-1; i++){
		scanf("%lld %lld",&tmp[i][0],&tmp[i][1]);
	}
	for(i = 0; i < _n-1; i++){
		scanf("%lld",&tmp2[i]);
	}
	printf(">> %lld\n",best_path(_n,_m,tmp,tmp2));

	return 0;	
}*/

Compilation message

race.cpp: In function 'void solve(long long int, long long int)':
race.cpp:45:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i = 0; i < adl[x].size(); i++){
             ~~^~~~~~~~~~~~~~~
race.cpp:60:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i = 0; i < adl[x].size(); i++){
             ~~^~~~~~~~~~~~~~~
race.cpp:84:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i = 0; i < adl[x].size(); i++){
             ~~^~~~~~~~~~~~~~~
race.cpp: In function 'long long int best_path(int, int, int (*)[2], int*)':
race.cpp:103:9: warning: unused variable 'j' [-Wunused-variable]
  long i,j;
         ^
race.cpp: In function 'void solve(long long int, long long int)':
race.cpp:91:10: warning: 'w' may be used uninitialized in this function [-Wmaybe-uninitialized]
  need = m-w-ls[sid[x]];
         ~^~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15996 KB Output is correct
2 Correct 14 ms 16232 KB Output is correct
3 Correct 14 ms 16300 KB Output is correct
4 Correct 15 ms 16300 KB Output is correct
5 Correct 15 ms 16300 KB Output is correct
6 Correct 15 ms 16300 KB Output is correct
7 Correct 15 ms 16300 KB Output is correct
8 Correct 15 ms 16300 KB Output is correct
9 Correct 15 ms 16300 KB Output is correct
10 Correct 15 ms 16300 KB Output is correct
11 Correct 17 ms 16300 KB Output is correct
12 Correct 21 ms 16300 KB Output is correct
13 Correct 14 ms 16300 KB Output is correct
14 Correct 15 ms 16300 KB Output is correct
15 Correct 17 ms 16300 KB Output is correct
16 Correct 17 ms 16300 KB Output is correct
17 Correct 17 ms 16300 KB Output is correct
18 Correct 15 ms 16300 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15996 KB Output is correct
2 Correct 14 ms 16232 KB Output is correct
3 Correct 14 ms 16300 KB Output is correct
4 Correct 15 ms 16300 KB Output is correct
5 Correct 15 ms 16300 KB Output is correct
6 Correct 15 ms 16300 KB Output is correct
7 Correct 15 ms 16300 KB Output is correct
8 Correct 15 ms 16300 KB Output is correct
9 Correct 15 ms 16300 KB Output is correct
10 Correct 15 ms 16300 KB Output is correct
11 Correct 17 ms 16300 KB Output is correct
12 Correct 21 ms 16300 KB Output is correct
13 Correct 14 ms 16300 KB Output is correct
14 Correct 15 ms 16300 KB Output is correct
15 Correct 17 ms 16300 KB Output is correct
16 Correct 17 ms 16300 KB Output is correct
17 Correct 17 ms 16300 KB Output is correct
18 Correct 15 ms 16300 KB Output is correct
19 Correct 14 ms 16300 KB Output is correct
20 Correct 14 ms 16300 KB Output is correct
21 Correct 18 ms 16364 KB Output is correct
22 Correct 16 ms 16412 KB Output is correct
23 Correct 16 ms 16412 KB Output is correct
24 Correct 17 ms 16412 KB Output is correct
25 Correct 17 ms 16412 KB Output is correct
26 Correct 16 ms 16412 KB Output is correct
27 Correct 15 ms 16412 KB Output is correct
28 Correct 17 ms 16412 KB Output is correct
29 Correct 16 ms 16412 KB Output is correct
30 Correct 16 ms 16412 KB Output is correct
31 Correct 16 ms 16412 KB Output is correct
32 Correct 16 ms 16508 KB Output is correct
33 Correct 17 ms 16508 KB Output is correct
34 Correct 15 ms 16508 KB Output is correct
35 Correct 15 ms 16508 KB Output is correct
36 Correct 15 ms 16508 KB Output is correct
37 Correct 15 ms 16508 KB Output is correct
38 Correct 16 ms 16508 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15996 KB Output is correct
2 Correct 14 ms 16232 KB Output is correct
3 Correct 14 ms 16300 KB Output is correct
4 Correct 15 ms 16300 KB Output is correct
5 Correct 15 ms 16300 KB Output is correct
6 Correct 15 ms 16300 KB Output is correct
7 Correct 15 ms 16300 KB Output is correct
8 Correct 15 ms 16300 KB Output is correct
9 Correct 15 ms 16300 KB Output is correct
10 Correct 15 ms 16300 KB Output is correct
11 Correct 17 ms 16300 KB Output is correct
12 Correct 21 ms 16300 KB Output is correct
13 Correct 14 ms 16300 KB Output is correct
14 Correct 15 ms 16300 KB Output is correct
15 Correct 17 ms 16300 KB Output is correct
16 Correct 17 ms 16300 KB Output is correct
17 Correct 17 ms 16300 KB Output is correct
18 Correct 15 ms 16300 KB Output is correct
19 Correct 170 ms 27312 KB Output is correct
20 Correct 169 ms 27312 KB Output is correct
21 Correct 172 ms 27388 KB Output is correct
22 Correct 197 ms 27516 KB Output is correct
23 Correct 48 ms 27516 KB Output is correct
24 Correct 204 ms 29820 KB Output is correct
25 Correct 105 ms 33148 KB Output is correct
26 Correct 86 ms 41084 KB Output is correct
27 Correct 297 ms 41084 KB Output is correct
28 Correct 415 ms 73456 KB Output is correct
29 Correct 355 ms 73456 KB Output is correct
30 Correct 341 ms 73456 KB Output is correct
31 Correct 345 ms 73456 KB Output is correct
32 Correct 368 ms 73456 KB Output is correct
33 Correct 293 ms 73456 KB Output is correct
34 Correct 616 ms 73456 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15996 KB Output is correct
2 Correct 14 ms 16232 KB Output is correct
3 Correct 14 ms 16300 KB Output is correct
4 Correct 15 ms 16300 KB Output is correct
5 Correct 15 ms 16300 KB Output is correct
6 Correct 15 ms 16300 KB Output is correct
7 Correct 15 ms 16300 KB Output is correct
8 Correct 15 ms 16300 KB Output is correct
9 Correct 15 ms 16300 KB Output is correct
10 Correct 15 ms 16300 KB Output is correct
11 Correct 17 ms 16300 KB Output is correct
12 Correct 21 ms 16300 KB Output is correct
13 Correct 14 ms 16300 KB Output is correct
14 Correct 15 ms 16300 KB Output is correct
15 Correct 17 ms 16300 KB Output is correct
16 Correct 17 ms 16300 KB Output is correct
17 Correct 17 ms 16300 KB Output is correct
18 Correct 15 ms 16300 KB Output is correct
19 Correct 14 ms 16300 KB Output is correct
20 Correct 14 ms 16300 KB Output is correct
21 Correct 18 ms 16364 KB Output is correct
22 Correct 16 ms 16412 KB Output is correct
23 Correct 16 ms 16412 KB Output is correct
24 Correct 17 ms 16412 KB Output is correct
25 Correct 17 ms 16412 KB Output is correct
26 Correct 16 ms 16412 KB Output is correct
27 Correct 15 ms 16412 KB Output is correct
28 Correct 17 ms 16412 KB Output is correct
29 Correct 16 ms 16412 KB Output is correct
30 Correct 16 ms 16412 KB Output is correct
31 Correct 16 ms 16412 KB Output is correct
32 Correct 16 ms 16508 KB Output is correct
33 Correct 17 ms 16508 KB Output is correct
34 Correct 15 ms 16508 KB Output is correct
35 Correct 15 ms 16508 KB Output is correct
36 Correct 15 ms 16508 KB Output is correct
37 Correct 15 ms 16508 KB Output is correct
38 Correct 16 ms 16508 KB Output is correct
39 Correct 170 ms 27312 KB Output is correct
40 Correct 169 ms 27312 KB Output is correct
41 Correct 172 ms 27388 KB Output is correct
42 Correct 197 ms 27516 KB Output is correct
43 Correct 48 ms 27516 KB Output is correct
44 Correct 204 ms 29820 KB Output is correct
45 Correct 105 ms 33148 KB Output is correct
46 Correct 86 ms 41084 KB Output is correct
47 Correct 297 ms 41084 KB Output is correct
48 Correct 415 ms 73456 KB Output is correct
49 Correct 355 ms 73456 KB Output is correct
50 Correct 341 ms 73456 KB Output is correct
51 Correct 345 ms 73456 KB Output is correct
52 Correct 368 ms 73456 KB Output is correct
53 Correct 293 ms 73456 KB Output is correct
54 Correct 616 ms 73456 KB Output is correct
55 Correct 37 ms 73456 KB Output is correct
56 Correct 30 ms 73456 KB Output is correct
57 Correct 134 ms 73456 KB Output is correct
58 Correct 102 ms 73456 KB Output is correct
59 Correct 109 ms 73456 KB Output is correct
60 Correct 330 ms 73456 KB Output is correct
61 Correct 304 ms 73456 KB Output is correct
62 Correct 341 ms 73456 KB Output is correct
63 Correct 375 ms 73456 KB Output is correct
64 Incorrect 774 ms 73456 KB Output isn't correct
65 Halted 0 ms 0 KB -