oj.uz

Submission #1053252

# Submission time Handle Problem Language Result Execution time Memory
1053252 2024-08-11T10:06:23 Z dozer Fountain Parks (IOI21_parks) C++17
5 / 100
 3500 ms 127196 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n"
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define pb push_back
#define pii pair<int, int>
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define st first
#define nd second
#define ll long long
#define LL node * 2
#define RR node * 2 + 1
#define N 300005


const int modulo = 1e9 + 7;
const ll INF = 2e18 + 7;


int par[N], sz[N], TOT;
pii rev[N];

int find(int node){
	if (par[node] == node) return node;
	return par[node] = find(par[node]);
}


void uni(int a, int b){
	a = find(a), b = find(b);
	if (a == b) return;
	TOT--;
	if (sz[a] < sz[b]) swap(a, b);
	par[b] = a;
	sz[a] += b;
}


int construct_roads(vector<int> x, vector<int> y) {
    if (x.size() == 1) {
		build({}, {}, {}, {});
	    return 1;
    }
    map<pii ,int> ind;
    int n = x.size();
    for (int i = 0; i < n; i++){
    	ind[{x[i], y[i]}] = i;
    	sz[i] = 1, par[i] = i;
    }

    vector<pii> dir = {{0, -2}, {-2, 0}, {0, 2}, {2, 0}};

    vector<pii> edges, b1, b2;
    map<pii, int> cnt;
    map<pii, set<int>> rev2;

    int cntr = 0;
    for (int i = 0; i < n; i++){
    	int a = x[i], b = y[i];
    	for (auto k : dir){
    		int c = a + k.st, d = b + k.nd;
    		if (ind.count({c, d}) && ind[{c, d}] > i){
    			int g = (a + c) / 2, h = (b + d) / 2;
    			pii f1, f2;
    			if (b == d){
    				f1 = {g, h + 1};
    				f2 = {g, h - 1};
    			}
    			else{
    				f1 = {g + 1, h};
    				f2 = {g - 1, h};
    			}
    			edges.pb({i, ind[{c, d}]});
    			b1.pb(f1);
    			b2.pb(f2);
    			rev2[f1].insert(cntr);
    			rev2[f2].insert(cntr);
    			cnt[f1]++;
    			cnt[f2]++;
    			cntr++;
    		}
    	}
    }

    queue<int> q;
    for (int i = 0; i < cntr; i++){
    	if (cnt[b1[i]] == 1 || cnt[b2[i]] == 1) q.push(i);
    }

 	vector<int> u, v, a, b;
    
    set<int> undone;

    for (int i = 0; i < cntr; i++) undone.insert(i);
    TOT = n;
	while(TOT > 1){
		 while(!q.empty()){
	    	int top = q.front();
	    	q.pop();
	    	undone.erase(top);
	    	
	    	pii todo = {-1, -1};
	    	if (cnt[b1[top]] == 1) todo = b1[top];
	    	else if (cnt[b2[top]] == 1) todo = b2[top];
	    	if (todo.st == -1) continue;

	    	a.pb(todo.st), b.pb(todo.nd);
	    	vector<pii> V = {b1[top], b2[top]};
	    	for (auto i : V){
	    		cnt[i]--;
	    		rev2[i].erase(top);
	    		if (rev2[i].size()){
	    			q.push(*rev2[i].begin());
	    		}
	    	}

	    	u.pb(edges[top].st);
	    	v.pb(edges[top].nd);
	    	uni(edges[top].st, edges[top].nd);
	    }	

	    if (TOT == 1) break;
	    vector<int> del;
	    for (auto i : undone){
	    	if (find(edges[i].st) == find(edges[i].nd)) del.pb(i); 
	    	else if (cnt[b1[i]] == 0 && cnt[b2[i]] == 0) del.pb(i);
          	
	    }

	    for (auto i : del) undone.erase(i);

	    if (undone.empty()) break;
		int tmp = *undone.begin();
		cnt[b1[tmp]] = 1;
		q.push(tmp);
	}

	
	if (TOT == 1){
		build(u, v, a, b);
		return 1;
	}
   
   return 0;
}

/*
static void check(bool cond, string message) {
	if (!cond) {
		printf("%s\n", message.c_str());
		fclose(stdout);
		exit(0);
	}
}

static int n;
static bool build_called;
static int m;
static vector<int> _u, _v, _a, _b;

void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b) {
	check(!build_called, "build is called more than once");
	build_called = true;
	m = u.size();
	check(int(v.size()) == m, "u.size() != v.size()");
	check(int(a.size()) == m, "u.size() != a.size()");
	check(int(b.size()) == m, "u.size() != b.size()");
	_u = u;
	_v = v;
	_a = a;
	_b = b;
}

int main() {
	fileio();
	assert(scanf("%d", &n) == 1);
	vector<int> x(n), y(n);
	for (int i = 0; i < n; i++) {
		assert(scanf("%d%d", &x[i], &y[i]) == 2);
	}
	fclose(stdin);

	build_called = false;
	const int possible = construct_roads(x, y);

	check(possible == 0 || possible == 1, "Invalid return value of construct_roads()");
	if (possible == 1) {
		check(build_called, "construct_roads() returned 1 without calling build()");
	} else {
		check(!build_called, "construct_roads() called build() but returned 0");
	}

	printf("%d\n", possible);
	if (possible == 1) {
		printf("%d\n", m);
		for (int j = 0; j < m; j++) {
			printf("%d %d %d %d\n", _u[j], _v[j], _a[j], _b[j]);
		}
	}
	fclose(stdout);
	return 0;
}*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 465 ms 63716 KB Output is correct
10 Correct 20 ms 8280 KB Output is correct
11 Correct 131 ms 34180 KB Output is correct
12 Correct 29 ms 10848 KB Output is correct
13 Correct 110 ms 27964 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 4 ms 3420 KB Output is correct
16 Correct 463 ms 63716 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 465 ms 63716 KB Output is correct
10 Correct 20 ms 8280 KB Output is correct
11 Correct 131 ms 34180 KB Output is correct
12 Correct 29 ms 10848 KB Output is correct
13 Correct 110 ms 27964 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 4 ms 3420 KB Output is correct
16 Correct 463 ms 63716 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Incorrect 1 ms 2396 KB Edge between 0 and 5 appears more than once: appeared on positions 1 and 6
20 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 465 ms 63716 KB Output is correct
10 Correct 20 ms 8280 KB Output is correct
11 Correct 131 ms 34180 KB Output is correct
12 Correct 29 ms 10848 KB Output is correct
13 Correct 110 ms 27964 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 4 ms 3420 KB Output is correct
16 Correct 463 ms 63716 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Incorrect 1 ms 2396 KB Edge between 0 and 5 appears more than once: appeared on positions 1 and 6
20 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 465 ms 63716 KB Output is correct
10 Correct 20 ms 8280 KB Output is correct
11 Correct 131 ms 34180 KB Output is correct
12 Correct 29 ms 10848 KB Output is correct
13 Correct 110 ms 27964 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 4 ms 3420 KB Output is correct
16 Correct 463 ms 63716 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 975 ms 94356 KB Output is correct
21 Correct 954 ms 94560 KB Output is correct
22 Correct 941 ms 94504 KB Output is correct
23 Correct 899 ms 108580 KB Output is correct
24 Correct 182 ms 18004 KB Output is correct
25 Correct 1177 ms 120128 KB Output is correct
26 Correct 1203 ms 120380 KB Output is correct
27 Correct 1195 ms 127028 KB Output is correct
28 Correct 1137 ms 127016 KB Output is correct
29 Correct 1127 ms 127196 KB Output is correct
30 Correct 1130 ms 127124 KB Output is correct
31 Correct 0 ms 2396 KB Output is correct
32 Correct 52 ms 8988 KB Output is correct
33 Correct 74 ms 10312 KB Output is correct
34 Correct 891 ms 94500 KB Output is correct
35 Correct 42 ms 7156 KB Output is correct
36 Correct 1348 ms 25404 KB Output is correct
37 Execution timed out 3562 ms 48436 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 465 ms 63716 KB Output is correct
10 Correct 20 ms 8280 KB Output is correct
11 Correct 131 ms 34180 KB Output is correct
12 Correct 29 ms 10848 KB Output is correct
13 Correct 110 ms 27964 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 4 ms 3420 KB Output is correct
16 Correct 463 ms 63716 KB Output is correct
17 Correct 1188 ms 126724 KB Output is correct
18 Correct 1105 ms 125224 KB Output is correct
19 Correct 1101 ms 94484 KB Output is correct
20 Execution timed out 3554 ms 101924 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 465 ms 63716 KB Output is correct
10 Correct 20 ms 8280 KB Output is correct
11 Correct 131 ms 34180 KB Output is correct
12 Correct 29 ms 10848 KB Output is correct
13 Correct 110 ms 27964 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 4 ms 3420 KB Output is correct
16 Correct 463 ms 63716 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Incorrect 1 ms 2396 KB Edge between 0 and 5 appears more than once: appeared on positions 1 and 6
20 Halted 0 ms 0 KB -