oj.uz

Submission #1009891

# Submission time Handle Problem Language Result Execution time Memory
1009891 2024-06-28T07:19:33 Z pcc Game (APIO22_game) C++17
2 / 100
 5 ms 8704 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,popcnt,sse4")
 
const int mxk = 1010;
const int mxn = 3e4+10;
 
bool flag = false;
char cnt[mxk*mxn];
int N,K;
 
void add(int k){
	assert(k<mxn*mxk);
	cnt[k]++;
	if(cnt[k]>=2)flag = true;
	return;
}
 
const int LEN = 1e5+10;
int head[LEN],to[LEN],nid[LEN],p1;
int rhead[LEN],rto[LEN],rnid[LEN],p2;

void add_edge(short a,short b){
	assert(p1<LEN);
	//cerr<<a<<','<<b<<':'<<p1<<endl;
	p1++;
	nid[p1] = head[a];
	to[p1] = b;
	head[a] = p1;
}

void radd_edge(short a,short b){
	assert(p2<LEN);
	p2++;
	rnid[p2] = head[a];
	rto[p2] = b;
	rhead[a] = p2;
	return;
}
 
struct DS{
	bitset<mxn> vis,rvis;
	short id;
	DS(short ii = 0):id(ii){vis.reset();rvis.reset();}
	queue<short> q;

	void BFS(short now){
		if(vis[now])return;
		q.push(now);
		vis[now] = true;add(N*id+now);
		while(!q.empty()){
			auto now = q.front();
			q.pop();
			for(int eid = head[now];eid;eid = nid[eid]){
				int nxt = to[eid];
				if(vis[nxt])continue;
				vis[nxt] = true;add(N*id+nxt);
				q.push(nxt);
			}
		}
		return;
	}

	void RBFS(short now){
		if(rvis[now])return;
		q.push(now);
		rvis[now] = true;add(N*id+now);
		while(!q.empty()){
			auto now = q.front();
			q.pop();
			for(int eid = rhead[now];eid;eid = rnid[eid]){
				int nxt = rto[eid];
				if(rvis[nxt])continue;
				rvis[nxt] = true;add(N*id+nxt);
				q.push(nxt);
			}
		}
		return;
	}

	void add_edge(short a,short b){
		if(vis[a])BFS(b);
		if(rvis[b])RBFS(a);
		return;
	}
};
 
DS arr[mxk];
 
void init(int n, int k) {
	N = n,K = k;
	for(int i = 0;i<k;i++){
		arr[i].id = i;
		arr[i].vis[i] = arr[i].rvis[i] = 1;
	}
	for(short i = 0;i<=k-2;i++){
		add_edge(i,i+1);
		radd_edge(i+1,i);
		for(short j = 0;j<k;j++){
			arr[j].add_edge(i,i+1);
		}
	}
	flag = false;
	/*
	cerr<<"INIT DONE!"<<endl;
	for(int i = 0;i<K;i++){
		for(int j = 0;j<N;j++)cerr<<arr[i].vis[j];cerr<<endl;
		for(int j = 0;j<N;j++)cerr<<arr[i].rvis[j];cerr<<endl;
		cerr<<endl;
	}
	*/
	return;
}
 
int add_teleporter(int u, int v) {
	if(u == v){
		return (u<K);
	}
	add_edge(u,v);
	radd_edge(v,u);
	for(short i = 0;i<K;i++){
		arr[i].add_edge(u,v);
	}
	return flag;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8536 KB Output is correct
2 Correct 3 ms 8536 KB Output is correct
3 Correct 4 ms 8536 KB Output is correct
4 Correct 3 ms 8536 KB Output is correct
5 Correct 3 ms 8536 KB Output is correct
6 Correct 3 ms 8424 KB Output is correct
7 Correct 4 ms 8536 KB Output is correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8536 KB Output is correct
2 Correct 3 ms 8536 KB Output is correct
3 Correct 4 ms 8536 KB Output is correct
4 Correct 3 ms 8536 KB Output is correct
5 Correct 3 ms 8536 KB Output is correct
6 Correct 3 ms 8424 KB Output is correct
7 Correct 4 ms 8536 KB Output is correct
8 Correct 3 ms 8536 KB Output is correct
9 Correct 3 ms 8480 KB Output is correct
10 Correct 3 ms 8540 KB Output is correct
11 Correct 3 ms 8536 KB Output is correct
12 Correct 3 ms 8536 KB Output is correct
13 Correct 3 ms 8536 KB Output is correct
14 Correct 3 ms 8540 KB Output is correct
15 Incorrect 5 ms 8704 KB Wrong Answer[1]
16 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8536 KB Output is correct
2 Correct 3 ms 8536 KB Output is correct
3 Correct 4 ms 8536 KB Output is correct
4 Correct 3 ms 8536 KB Output is correct
5 Correct 3 ms 8536 KB Output is correct
6 Correct 3 ms 8424 KB Output is correct
7 Correct 4 ms 8536 KB Output is correct
8 Correct 3 ms 8536 KB Output is correct
9 Correct 3 ms 8480 KB Output is correct
10 Correct 3 ms 8540 KB Output is correct
11 Correct 3 ms 8536 KB Output is correct
12 Correct 3 ms 8536 KB Output is correct
13 Correct 3 ms 8536 KB Output is correct
14 Correct 3 ms 8540 KB Output is correct
15 Incorrect 5 ms 8704 KB Wrong Answer[1]
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8536 KB Output is correct
2 Correct 3 ms 8536 KB Output is correct
3 Correct 4 ms 8536 KB Output is correct
4 Correct 3 ms 8536 KB Output is correct
5 Correct 3 ms 8536 KB Output is correct
6 Correct 3 ms 8424 KB Output is correct
7 Correct 4 ms 8536 KB Output is correct
8 Correct 3 ms 8536 KB Output is correct
9 Correct 3 ms 8480 KB Output is correct
10 Correct 3 ms 8540 KB Output is correct
11 Correct 3 ms 8536 KB Output is correct
12 Correct 3 ms 8536 KB Output is correct
13 Correct 3 ms 8536 KB Output is correct
14 Correct 3 ms 8540 KB Output is correct
15 Incorrect 5 ms 8704 KB Wrong Answer[1]
16 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8536 KB Output is correct
2 Correct 3 ms 8536 KB Output is correct
3 Correct 4 ms 8536 KB Output is correct
4 Correct 3 ms 8536 KB Output is correct
5 Correct 3 ms 8536 KB Output is correct
6 Correct 3 ms 8424 KB Output is correct
7 Correct 4 ms 8536 KB Output is correct
8 Correct 3 ms 8536 KB Output is correct
9 Correct 3 ms 8480 KB Output is correct
10 Correct 3 ms 8540 KB Output is correct
11 Correct 3 ms 8536 KB Output is correct
12 Correct 3 ms 8536 KB Output is correct
13 Correct 3 ms 8536 KB Output is correct
14 Correct 3 ms 8540 KB Output is correct
15 Incorrect 5 ms 8704 KB Wrong Answer[1]
16 Halted 0 ms 0 KB -