oj.uz

Submission #85491

# Submission time Handle Problem Language Result Execution time Memory
85491 2018-11-20T13:41:19 Z tmwilliamlin168 Park (JOI17_park) C++14
0 / 100
 3 ms 652 KB 
#include "park.h"
#include <bits/stdc++.h>
using namespace std;

const int mxN=1400;
int n, p[mxN], a[mxN], d[mxN], e[mxN][7];
vector<int> dl;
bool vis[mxN];

void ae(int u, int v) {
	e[u][d[u]++]=v;
	e[v][d[v]++]=u;
	Answer(min(u, v), max(u, v));
}

void dfs(int u) {
	vis[u]=1;
	dl.push_back(u);
	for(int i=0; i<d[u]; ++i)
		if(!vis[e[u][i]]&&a[e[u][i]]!=3)
			dfs(e[u][i]);
}

void b(int u) {
	a[u]=2;
	while(1) {
		for(int i=0; i<n; ++i)
			p[i]=a[i]==1;
		p[u]=1;
		if(Ask(0, u, p))
			break;
		int lb=0, rb=n-1;
		while(lb<rb) {
			int mb=(lb+rb)/2;
			for(int i=0; i<n; ++i)
				p[i]=a[i]==1||!a[i]&&i<=mb;
			p[u]=1;
			if(Ask(0, u, p))
				rb=mb;
			else
				lb=mb+1;
		}
		b(lb);
	}
	vector<int> f{0};
	for(int i=0; i<f.size(); ++i) {
		while(a[f[i]]!=3) {
			memset(vis, 0, n);
			dl.clear();
			dfs(f[i]);
			memset(p, 0, 4*n);
			for(int di : dl)
				p[di]=1;
			p[u]=1;
			if(!Ask(f[i], u, p))
				break;
			int lb=0, rb=dl.size()-1;
			while(lb<rb) {
				int mb=(lb+rb)/2;
				memset(p, 0, 4*n);
				for(int j=0; j<=mb; ++j)
					p[dl[j]]=1;
				p[u]=1;
				if(Ask(f[i], u, p))
					rb=mb;
				else
					lb=mb+1;
			}
			for(int j=0; j<d[dl[lb]]; ++j)
				if(e[dl[lb]][j]>dl[lb])
					f.push_back(e[dl[lb]][j]);
			ae(u, dl[lb]);
			a[dl[lb]]=3;
		}
	}
	for(int i=0; i<n; ++i)
		if(a[i]==3)
			a[i]=1;
	a[u]=1;
}

void Detect(int T, int N) {
	n=N;
	a[0]=1;
	for(int i=1; i<n; ++i)
		if(!a[i])
			b(i);
}

Compilation message

park.cpp: In function 'void b(int)':
park.cpp:36:24: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
     p[i]=a[i]==1||!a[i]&&i<=mb;
                   ~~~~~^~~~~~~
park.cpp:46:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<f.size(); ++i) {
               ~^~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Wrong Answer[4]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 580 KB Wrong Answer[4]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 604 KB Wrong Answer[4]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 604 KB Wrong Answer[4]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 652 KB Wrong Answer[4]
2 Halted 0 ms 0 KB -