oj.uz

답안 #973964

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973964 2024-05-02T13:40:29 Z c2zi6 Stranded Far From Home (BOI22_island) C++14
20 / 100
 1000 ms 397124 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

int n, m;
VI s;
VVI gp;
VI ans;

// n, m <= 2000
namespace TEST1 {
	void main() {
		rep(r, n) {
			VI vis(n);
			ll sum = s[r];
			vis[r] = true;
			priority_queue<PII> pq;
			for (int v : gp[r]) pq.push({-s[v], v});
			while (pq.size()) {
				int u = pq.top().ss;
				pq.pop();
				if (vis[u]) continue;
				if (sum >= s[u]) {
					sum += s[u];
					vis[u] = true;
					for (int v : gp[u]) if (!vis[v]) pq.push({-s[v], v});
				} else {
					break;
				}
			}
			bool kexni = true;
			rep(u, n) if (!vis[u]) kexni = false;
			ans[r] = kexni;
		}
	}
}

// tree 
namespace TEST2 {
	VL subsum;
	VI par;
	VI vat;
	void dfs1(int u = 0, int p = -1) {
		par[u] = p;
		subsum[u] = s[u];
		for (int v : gp[u]) if (v != p) {
			dfs1(v, u);
			subsum[u] += subsum[v];
		}
	}
	void dfs2(int u = 0, int p = -1) {
		if (u && vat[p]) vat[u] = true;
		for (int v : gp[u]) if (v != p) dfs2(v, u);
	}
	void main() {
		subsum = VL(n);
		par = VI(n);
		vat = VI(n);
		dfs1();
		replr(u, 1, n-1) {
			if (s[par[u]] > subsum[u]) vat[u] = true;
		}
		dfs2();
		rep(i, n) ans[i] = !vat[i];
	}
}

void solve() {
	cin >> n >> m;
	s = VI(n);
	for (int& x : s) cin >> x;
	gp = VVI(n);
	rep(i, m) {
		int u, v;
		cin >> u >> v;
		u--, v--;
		gp[u].pb(v);
		gp[v].pb(u);
	}
	ans = VI(n);
	if (n <= 2000 && m <= 2000) TEST1::main();
	else {
		TEST2::main();
	}
	for (int x : ans) cout << x; cout << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int t = 1;
    /* cin >> t; */
    while (t--) solve();
}

Compilation message

island.cpp: In function 'void solve()':
island.cpp:113:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  113 |  for (int x : ans) cout << x; cout << endl;
      |  ^~~
island.cpp:113:31: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  113 |  for (int x : ans) cout << x; cout << endl;
      |                               ^~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 183 ms 604 KB Output is correct
5 Correct 135 ms 608 KB Output is correct
6 Correct 276 ms 600 KB Output is correct
7 Correct 185 ms 604 KB Output is correct
8 Correct 139 ms 564 KB Output is correct
9 Correct 203 ms 604 KB Output is correct
10 Correct 52 ms 604 KB Output is correct
11 Correct 46 ms 600 KB Output is correct
12 Correct 45 ms 604 KB Output is correct
13 Correct 81 ms 604 KB Output is correct
14 Correct 83 ms 604 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 127 ms 23936 KB Output is correct
4 Correct 86 ms 24404 KB Output is correct
5 Correct 104 ms 20048 KB Output is correct
6 Correct 108 ms 20568 KB Output is correct
7 Correct 110 ms 20680 KB Output is correct
8 Correct 117 ms 20812 KB Output is correct
9 Correct 85 ms 20628 KB Output is correct
10 Correct 63 ms 20484 KB Output is correct
11 Correct 86 ms 20712 KB Output is correct
12 Correct 96 ms 19280 KB Output is correct
13 Correct 92 ms 31572 KB Output is correct
14 Correct 96 ms 31892 KB Output is correct
15 Correct 103 ms 33108 KB Output is correct
16 Correct 72 ms 32080 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 103 ms 30988 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 1112 ms 397124 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 183 ms 604 KB Output is correct
5 Correct 135 ms 608 KB Output is correct
6 Correct 276 ms 600 KB Output is correct
7 Correct 185 ms 604 KB Output is correct
8 Correct 139 ms 564 KB Output is correct
9 Correct 203 ms 604 KB Output is correct
10 Correct 52 ms 604 KB Output is correct
11 Correct 46 ms 600 KB Output is correct
12 Correct 45 ms 604 KB Output is correct
13 Correct 81 ms 604 KB Output is correct
14 Correct 83 ms 604 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 127 ms 23936 KB Output is correct
18 Correct 86 ms 24404 KB Output is correct
19 Correct 104 ms 20048 KB Output is correct
20 Correct 108 ms 20568 KB Output is correct
21 Correct 110 ms 20680 KB Output is correct
22 Correct 117 ms 20812 KB Output is correct
23 Correct 85 ms 20628 KB Output is correct
24 Correct 63 ms 20484 KB Output is correct
25 Correct 86 ms 20712 KB Output is correct
26 Correct 96 ms 19280 KB Output is correct
27 Correct 92 ms 31572 KB Output is correct
28 Correct 96 ms 31892 KB Output is correct
29 Correct 103 ms 33108 KB Output is correct
30 Correct 72 ms 32080 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 103 ms 30988 KB Output isn't correct
33 Halted 0 ms 0 KB -