oj.uz

Submission #933823

# Submission time Handle Problem Language Result Execution time Memory
933823 2024-02-26T11:23:58 Z kim Highway Tolls (IOI18_highway) C++17
5 / 100
 159 ms 11720 KB 
#include "highway.h"
#include<bits/stdc++.h>
using namespace std;
#define eb emplace_back
using pii=pair<int,int>;
#define f first
#define s second

using ti3=tuple<int,int,int>;

vector<int> adj1[90005],adj2[90005];
bitset<90005> vis;
int pre[90005];

vector<int> ans,tmp;
int dist;
int play(int n,vector<int> &U,vector<int> &V,int u0){
	// for(int i=0;i<n;++i) adj2[i].clear();
	vis=0;
	int m=U.size();
	{
		int id=0;
		queue<int> q;
		q.emplace(u0);
		vis[u0]=1;
		pre[u0]=0;
		while(q.size()){
			int u=q.front(); q.pop();
			for(auto &v:adj1[u]){
				if(vis[v]) continue;
				vis[v]=1;
				q.emplace(v);
				// adj2[u].eb(v);
				// adj2[v].eb(u);
				pre[v]=++id;
			}
		}
	}
	// {
	// 	stack<pii> st;
	// 	st.emplace(u0,u0);
	// 	int id=-1;
	// 	while(st.size()){
	// 		auto [u,p]=st.top(); st.pop();
	// 		pre[u]=++id;
	// 		for(auto &v:adj2[u]){
	// 			if(v!=p) st.emplace(v,u);
	// 		}
	// 	}
	// }
	int l=0,r=n-1;
	while(l<r){
		int mid=l+r>>1;
		for(int i=0;i<m;++i){
			if(pre[U[i]]<=mid&&pre[V[i]]<=mid) tmp[i]=0;
			else tmp[i]=1;
		}
		if(ask(tmp)==dist) r=mid;
		else l=mid+1;
	}
	cerr<<pre[0]<<" "<<pre[1]<<" "<<pre[2]<<" "<<pre[3]<<'\n';
	for(int i=0;i<n;++i){
		if(pre[i]==l){
			ans.eb(i);
			return i;
		}
	}
}

void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
	for(int i=0;i<U.size();++i){
		adj1[U[i]].eb(V[i]);
		adj1[V[i]].eb(U[i]);
	}
	tmp.assign((int)U.size(),0);
	dist=ask(tmp);
	play(N,U,V,play(N,U,V,0));
	answer(ans[0],ans[1]);
}

Compilation message

highway.cpp: In function 'int play(int, std::vector<int>&, std::vector<int>&, int)':
highway.cpp:53:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   53 |   int mid=l+r>>1;
      |           ~^~
highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:71:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |  for(int i=0;i<U.size();++i){
      |              ~^~~~~~~~~
highway.cpp: In function 'int play(int, std::vector<int>&, std::vector<int>&, int)':
highway.cpp:68:1: warning: control reaches end of non-void function [-Wreturn-type]
   68 | }
      | ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4860 KB Output is correct
2 Correct 1 ms 4864 KB Output is correct
3 Correct 1 ms 4860 KB Output is correct
4 Correct 1 ms 4860 KB Output is correct
5 Correct 1 ms 4864 KB Output is correct
6 Correct 1 ms 4860 KB Output is correct
7 Correct 1 ms 4864 KB Output is correct
8 Correct 1 ms 4864 KB Output is correct
9 Correct 1 ms 4860 KB Output is correct
10 Correct 1 ms 4864 KB Output is correct
11 Correct 2 ms 4860 KB Output is correct
12 Correct 1 ms 5112 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5168 KB Output is correct
2 Correct 13 ms 5432 KB Output is correct
3 Correct 94 ms 10356 KB Output is correct
4 Correct 91 ms 9992 KB Output is correct
5 Correct 113 ms 10476 KB Output is correct
6 Correct 99 ms 9988 KB Output is correct
7 Correct 103 ms 10000 KB Output is correct
8 Correct 99 ms 10020 KB Output is correct
9 Correct 86 ms 10236 KB Output is correct
10 Correct 87 ms 10000 KB Output is correct
11 Correct 97 ms 10308 KB Output is correct
12 Correct 98 ms 10344 KB Output is correct
13 Correct 98 ms 9732 KB Output is correct
14 Incorrect 114 ms 9668 KB Output is incorrect: {s, t} is wrong.
15 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 5436 KB Output is correct
2 Correct 18 ms 6172 KB Output is correct
3 Correct 26 ms 6516 KB Output is correct
4 Correct 96 ms 9844 KB Output is correct
5 Correct 71 ms 9672 KB Output is correct
6 Correct 114 ms 9624 KB Output is correct
7 Correct 62 ms 9624 KB Output is correct
8 Correct 71 ms 9860 KB Output is correct
9 Incorrect 88 ms 9852 KB Output is incorrect: {s, t} is wrong.
10 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4912 KB Output is correct
2 Correct 10 ms 5436 KB Output is correct
3 Correct 66 ms 9208 KB Output is correct
4 Correct 110 ms 9988 KB Output is correct
5 Correct 82 ms 9988 KB Output is correct
6 Correct 143 ms 10004 KB Output is correct
7 Correct 112 ms 10000 KB Output is correct
8 Correct 94 ms 9984 KB Output is correct
9 Incorrect 70 ms 9752 KB Output is incorrect: {s, t} is wrong.
10 Halted 0 ms 0 KB -

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 5472 KB Output is correct
2 Correct 19 ms 5472 KB Output is correct
3 Correct 159 ms 10472 KB Output is correct
4 Correct 136 ms 10932 KB Output is correct
5 Correct 146 ms 11720 KB Output is correct
6 Correct 139 ms 11688 KB Output is correct
7 Correct 148 ms 11444 KB Output is correct
8 Incorrect 133 ms 11444 KB Output is incorrect: {s, t} is wrong.
9 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 5456 KB Output is incorrect: {s, t} is wrong.
2 Halted 0 ms 0 KB -