oj.uz

답안 #973922

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973922 2024-05-02T12:58:45 Z c2zi6 Stranded Far From Home (BOI22_island) C++14
10 / 100
 1000 ms 18504 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;

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);
	}


	VI ans(n);
	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;
			/* cout << "VARAQVAV " << u+1 << endl; */
			/* cout << "SUM = " << sum << endl; */
			/* cout << "s[" << u+1 << "] = " << s[u] << endl; */
			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;
		/* if (kexni) cout << "YES" << endl; */
		/* else cout << "NO" << endl; */
	}

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 175 ms 604 KB Output is correct
5 Correct 135 ms 608 KB Output is correct
6 Correct 274 ms 604 KB Output is correct
7 Correct 180 ms 604 KB Output is correct
8 Correct 139 ms 348 KB Output is correct
9 Correct 193 ms 608 KB Output is correct
10 Correct 48 ms 600 KB Output is correct
11 Correct 45 ms 600 KB Output is correct
12 Correct 55 ms 600 KB Output is correct
13 Correct 81 ms 604 KB Output is correct
14 Correct 82 ms 600 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 175 ms 604 KB Output is correct
5 Correct 135 ms 608 KB Output is correct
6 Correct 274 ms 604 KB Output is correct
7 Correct 180 ms 604 KB Output is correct
8 Correct 139 ms 348 KB Output is correct
9 Correct 193 ms 608 KB Output is correct
10 Correct 48 ms 600 KB Output is correct
11 Correct 45 ms 600 KB Output is correct
12 Correct 55 ms 600 KB Output is correct
13 Correct 81 ms 604 KB Output is correct
14 Correct 82 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 500 KB Output is correct
17 Execution timed out 1071 ms 18504 KB Time limit exceeded
18 Halted 0 ms 0 KB -