oj.uz

Submission #158274

# Submission time Handle Problem Language Result Execution time Memory
158274 2019-10-16T01:58:23 Z kig9981 Highway Tolls (IOI18_highway) C++17
46 / 100
 307 ms 15456 KB 
#include "highway.h"
#include <bits/stdc++.h>
 
using namespace std;
 
vector<int> adj[90000];
int dist1[90000], dist2[90000];
bool chk[90000];
 
void find_pair(int N, vector<int> U, vector<int> V, int A, int B)
{
	int M=U.size(), S, T, s, e, E;
	vector<int> W(M,0), C1, C2;
	queue<int> Q;
	long long D=ask(W);
	for(int i=0;i<M;i++) {
		adj[U[i]].push_back(V[i]);
		adj[V[i]].push_back(U[i]);
	}
	s=0; e=N-1;
	while(s<=e) {
		int m=(s+e)>>1;
		for(int i=0;i<N;i++) W[i]=i<=m;
		if(ask(W)!=D) e=m-1;
		else s=m+1;
	}
	E=s;
	memset(dist1,0x7f,sizeof(dist1));
	memset(dist2,0x7f,sizeof(dist2));
	dist1[U[E]]=0; Q.push(U[E]);
	while(!Q.empty()) {
		int c=Q.front();
		Q.pop();
		for(auto n: adj[c]) if(dist1[n]>dist1[c]+1) {
			dist1[n]=dist1[c]+1;
			Q.push(n);
		}
	}
	dist2[V[E]]=0; Q.push(V[E]);
	while(!Q.empty()) {
		int c=Q.front();
		Q.pop();
		for(auto n: adj[c]) if(dist2[n]>dist2[c]+1) {
			dist2[n]=dist2[c]+1;
			Q.push(n);
		}
	}
	s=0; e=D/A-1;
	while(s<=e) {
		int m=(s+e)>>1;
		for(int i=0;i<M;i++) W[i]=(dist1[U[i]]<dist2[U[i]] && dist1[U[i]]>=m)^(dist1[V[i]]<dist2[V[i]] && dist1[V[i]]>=m);
		if(ask(W)!=D) s=m+1;
		else e=m-1;
	}
  assert(0<=e && e<D/A);
	for(int i=0;i<N;i++) {
		if(dist1[i]<dist2[i] && dist1[i]==e) C1.push_back(i);
		if(dist1[i]>dist2[i] && dist2[i]==D/A-s) C2.push_back(i);
		chk[i]=false;
	}
  assert(C1.size() && C2.size());
	s=0; e=C1.size()-1;
	while(s<=e) {
		int m=(s+e)>>1;
		for(int i=0;i<N;i++) chk[i]=false;
		for(int i=0;i<=m;i++) chk[C1[i]]=true;
		for(int i=0;i<M;i++) W[i]=chk[U[i]]^chk[V[i]];
		if(ask(W)!=D) e=m-1;
		else s=m+1;
	}
	S=C1[s];
	s=0; e=C2.size()-1;
	while(s<=e) {
		int m=(s+e)>>1;
		for(int i=0;i<N;i++) chk[i]=false;
		for(int i=0;i<=m;i++) chk[C2[i]]=true;
		for(int i=0;i<M;i++) W[i]=chk[U[i]]^chk[V[i]];
		if(ask(W)!=D) e=m-1;
		else s=m+1;
	}
	T=C2[s];
	answer(S,T);
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3080 KB Output is correct
2 Correct 4 ms 3164 KB Output is correct
3 Runtime error 11 ms 6400 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3112 KB Output is correct
2 Correct 23 ms 3576 KB Output is correct
3 Correct 181 ms 8060 KB Output is correct
4 Correct 192 ms 8040 KB Output is correct
5 Correct 207 ms 8052 KB Output is correct
6 Correct 200 ms 7964 KB Output is correct
7 Correct 202 ms 7992 KB Output is correct
8 Correct 211 ms 7892 KB Output is correct
9 Correct 195 ms 8048 KB Output is correct
10 Correct 206 ms 8052 KB Output is correct
11 Correct 215 ms 7780 KB Output is correct
12 Correct 211 ms 7792 KB Output is correct
13 Correct 206 ms 7736 KB Output is correct
14 Correct 204 ms 7800 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 3576 KB Output is correct
2 Correct 40 ms 4088 KB Output is correct
3 Correct 52 ms 4664 KB Output is correct
4 Correct 176 ms 7820 KB Output is correct
5 Correct 178 ms 7792 KB Output is correct
6 Correct 179 ms 7708 KB Output is correct
7 Correct 158 ms 7756 KB Output is correct
8 Correct 156 ms 7816 KB Output is correct
9 Correct 166 ms 7816 KB Output is correct

Subtask #4
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3192 KB Output is correct
2 Correct 24 ms 3576 KB Output is correct
3 Correct 140 ms 6824 KB Output is correct
4 Correct 197 ms 7984 KB Output is correct
5 Correct 212 ms 7948 KB Output is correct
6 Correct 182 ms 7864 KB Output is correct
7 Correct 187 ms 8024 KB Output is correct
8 Correct 189 ms 7868 KB Output is correct
9 Correct 206 ms 8088 KB Output is correct
10 Correct 207 ms 8156 KB Output is correct
11 Correct 205 ms 7732 KB Output is correct
12 Correct 219 ms 7736 KB Output is correct
13 Correct 238 ms 7800 KB Output is correct
14 Correct 205 ms 7796 KB Output is correct
15 Correct 177 ms 7948 KB Output is correct
16 Correct 188 ms 7888 KB Output is correct
17 Correct 221 ms 7732 KB Output is correct
18 Correct 211 ms 7840 KB Output is correct
19 Correct 189 ms 7940 KB Output is correct
20 Correct 211 ms 7740 KB Output is correct
21 Correct 184 ms 9260 KB Output is correct
22 Correct 196 ms 9228 KB Output is correct
23 Correct 208 ms 8976 KB Output is correct
24 Correct 250 ms 8856 KB Output is correct
25 Correct 232 ms 8016 KB Output is correct

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 3704 KB Output is correct
2 Correct 29 ms 3704 KB Output is correct
3 Correct 230 ms 8364 KB Output is correct
4 Correct 238 ms 8536 KB Output is correct
5 Correct 284 ms 8996 KB Output is correct
6 Correct 282 ms 9104 KB Output is correct
7 Correct 285 ms 8980 KB Output is correct
8 Correct 306 ms 8996 KB Output is correct
9 Runtime error 233 ms 14840 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 3576 KB Output is correct
2 Correct 28 ms 3668 KB Output is correct
3 Correct 240 ms 8352 KB Output is correct
4 Correct 211 ms 8348 KB Output is correct
5 Correct 223 ms 8472 KB Output is correct
6 Correct 289 ms 9052 KB Output is correct
7 Correct 235 ms 8300 KB Output is correct
8 Correct 233 ms 8356 KB Output is correct
9 Correct 237 ms 8416 KB Output is correct
10 Correct 278 ms 9064 KB Output is correct
11 Correct 276 ms 9004 KB Output is correct
12 Correct 307 ms 9000 KB Output is correct
13 Runtime error 253 ms 15456 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -