oj.uz

Submission #249486

# Submission time Handle Problem Language Result Execution time Memory
249486 2020-07-15T06:37:19 Z lyc Meetings (JOI19_meetings) C++14
0 / 100
 2000 ms 6552 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

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

using ii=pair<int,int>;
map<ii,int> memo;
int ask(int a, int b) {
	if (memo.count(ii(a,b))) return memo[ii(a,b)];
	return memo[ii(a,b)] = Query(0,a,b);
}

int ind[2005];
vector<int> al[2005];

void Solve(int N) {
	FOR(i,1,N-1) FOR(j,i+1,N-1) {
		int r = ask(i,j);
		if (r != 0) al[0].push_back(r), ++ind[r];
		if (r != i) al[r].push_back(i), ++ind[i];
		if (r != j) al[r].push_back(j), ++ind[j];
	}
	
	queue<int> q;
	q.push(0);
	while (!q.empty()) {
		int u = q.front(); q.pop();
		for (int v : al[u]) {
			if (--ind[v] == 0) {
				q.push(v);
				Bridge(u,v);
			}
		}
	}
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Wrong Answer [3]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Wrong Answer [3]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Wrong Answer [3]
3 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3075 ms 6552 KB Time limit exceeded
2 Halted 0 ms 0 KB -