oj.uz

Submission #261811

# Submission time Handle Problem Language Result Execution time Memory
261811 2020-08-12T05:35:10 Z lyc Colors (RMI18_colors) C++14
47 / 100
 3000 ms 54504 KB 
#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for (int i=(a);i>=(b);--i)
using ii=pair<int,int>;

const int mxN = 150005;
//~ const int mxN = 1505;

int N, M, A[mxN], B[mxN];
vector<int> al[mxN];

struct Update {	int x, y, u, v; };
struct Query { int b, u; };

struct UFDS {
	vector<int> p;
	vector<set<int>> s;
	vector<map<int,int>> col;
	
	vector<ii> history;
	
	void init() {
		p.resize(N+1);
		s.resize(N+1);
		col.resize(N+1);
		FOR(i,1,N){
			p[i] = i;
			s[i].clear();
			s[i].insert(i);
			col[i].clear();
			col[i][A[i]] = 1;
		}
	}
	
	bool unions(int i, int j) {
		//~ TRACE("UNIONS" _ i _ j);
		int x = p[i], y = p[j];
		if (x == y) return 0;
		if (SZ(s[x]) < SZ(s[y])) swap(x,y);
		history.emplace_back(x,y);
		for (int a : s[y]) {
			s[x].insert(a);
			++col[x][A[a]];
			p[a] = x;
		}
		return 1;
	}
	
	int getTime() { return SZ(history); }
	void undo(int t) {
		while (SZ(history) > t) {
			ii cur = history.back(); history.pop_back();
			int x = cur.first, y = cur.second;
			for (int a : s[y]) {
				s[x].erase(a);
				--col[x][A[a]];
				p[a] = y;
			}
		}
	}
	
	int query(int i, int c) {
		return col[p[i]][c];
	}
} ufds;

bool reach[mxN];

void dnc(int L, int R, vector<Update>& upd, vector<Query>& qry) {
	if (L > R) return;
	
	int t = ufds.getTime();
	vector<Update> ul, ur;
	vector<Query> ql, qr;
	int m = (L+R)/2;
	for (auto& u : upd) {
		if (L == u.x && R == u.y) ufds.unions(u.u,u.v);
		else if (u.y <= m) ul.push_back(u);
		else if (u.x > m) ur.push_back(u);
		else ul.push_back({u.x, m, u.u, u.v}), ur.push_back({m+1, u.y, u.u, u.v});
	}
	for (auto& q : qry) {
		if (q.b <= m) ql.push_back(q);
		else qr.push_back(q);
	}
	
	if (L != R) {
		dnc(L,m,ul,ql);
		dnc(m+1,R,ur,qr);
	}
	
	//~ TRACE(L _ R _ t _ ufds.getTime());
	//~ for (auto& u : upd) { if (L == u.x && R == u.y) cout << u.u _ u.v << " :: "; }
	//~ cout << endl;
	for (auto& q : qry) {
		//~ TRACE("QUERY" _ q.u _ q.b _ ufds.query(q.u, q.b));
		reach[q.u] |= ufds.query(q.u, q.b) > 0;
	}
	
	ufds.undo(t);
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    
    int TC; cin >> TC;
    while (TC--) {
		cin >> N >> M;
		FOR(i,1,N){ cin >> A[i]; }
		FOR(i,1,N){ cin >> B[i]; }
		
		FOR(i,1,N) al[i].clear();
		FOR(i,1,M){
			int U, V; cin >> U >> V;
			al[U].push_back(V);
			al[V].push_back(U);
		}
	
		bool ok = 1;
		vector<Update> upd;
		vector<Query> qry;
		FOR(u,1,N){
			if (A[u] < B[u]) { ok = 0; break; }
			for (int& v : al[u]) if (u < v) {
				int x = max(B[u],B[v]), y = min(A[u],A[v]);
				//~ TRACE("UPD" _ x _ y _ u _ v);
				if (x <= y) upd.push_back({ x, y, u, v });
			}
			qry.push_back({ B[u], u });
		}
		
		if (ok) {
			memset(reach,0,sizeof reach);
			ufds.init();
			dnc(1,N,upd,qry);
			//~ FOR(i,1,N){ cout << reach[i] << ' '; } cout << endl;
			FOR(i,1,N) ok &= reach[i];
		}
		cout << ok << '\n';
	}
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 4112 KB Output is correct
2 Correct 119 ms 4232 KB Output is correct
3 Correct 24 ms 5120 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 4504 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 4216 KB Output is correct
2 Correct 132 ms 4152 KB Output is correct
3 Correct 17 ms 4736 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 4216 KB Output is correct
2 Correct 132 ms 4152 KB Output is correct
3 Correct 17 ms 4736 KB Output is correct
4 Correct 707 ms 4144 KB Output is correct
5 Execution timed out 3024 ms 47068 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 4112 KB Output is correct
2 Correct 119 ms 4232 KB Output is correct
3 Correct 24 ms 5120 KB Output is correct
4 Correct 318 ms 4216 KB Output is correct
5 Correct 132 ms 4152 KB Output is correct
6 Correct 17 ms 4736 KB Output is correct
7 Correct 300 ms 4096 KB Output is correct
8 Correct 128 ms 4344 KB Output is correct
9 Correct 35 ms 4992 KB Output is correct

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 643 ms 4180 KB Output is correct
2 Execution timed out 3066 ms 54504 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 4276 KB Output is correct
2 Correct 25 ms 4800 KB Output is correct
3 Correct 21 ms 4480 KB Output is correct

Subtask #8
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 4112 KB Output is correct
2 Correct 119 ms 4232 KB Output is correct
3 Correct 24 ms 5120 KB Output is correct
4 Correct 131 ms 4504 KB Output is correct
5 Correct 318 ms 4216 KB Output is correct
6 Correct 132 ms 4152 KB Output is correct
7 Correct 17 ms 4736 KB Output is correct
8 Correct 707 ms 4144 KB Output is correct
9 Execution timed out 3024 ms 47068 KB Time limit exceeded
10 Halted 0 ms 0 KB -