oj.uz

Submission #722959

# Submission time Handle Problem Language Result Execution time Memory
722959 2023-04-13T06:24:36 Z MurotY Stranded Far From Home (BOI22_island) C++14
10 / 100
 495 ms 32592 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define sz size()
using namespace std;
const double pi = 2 * acos(0.0);
const ll N=1e6+7, M=998244353;
vector <ll> g[N];
ll a[N];
 
void solve()
{
	int n, m;
	cin >> n >> m;
	
	for (int i=1;i<=n;i++) cin >> a[i];
	for (int i=1;i<=m;i++){
		int x, y;
		cin >> x >> y;
		g[x].push_back(y);
		g[y].push_back(x);
	}
    if (n <= 2000 && m <= 2000){
		for (int i=1;i<=n;i++){
			set <pair <ll, ll>> q;
			vector <int> u(n+5, 0);
			q.insert({0, i});
			ll sum=0, cnt=0;
			while (!q.empty()){
			    pair <ll,ll> mn=*q.begin();
			    if (sum < mn.ff) break;
			    if (u[mn.ss]) continue;
			    u[mn.ss]=1;
			    q.erase(mn);
			    sum+=a[mn.ss];
			    for (auto l:g[mn.ss]){
			        if (!u[l]) {
			            q.insert({a[l], l});
			        }
			    }
			}
			if (q.sz == 0) cout << "1";
			else cout << "0";
		}		
	}
	return ;
}
int main(){
	ios;
	int t=1;	
//	cin >> t;
	while (t--){ 
	    solve();
	    cout << "\n";
	}
	return 0;
}

Compilation message

island.cpp: In function 'void solve()':
island.cpp:35:14: warning: unused variable 'cnt' [-Wunused-variable]
   35 |    ll sum=0, cnt=0;
      |              ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 15 ms 23764 KB Output is correct
3 Correct 14 ms 23764 KB Output is correct
4 Correct 336 ms 23904 KB Output is correct
5 Correct 282 ms 24012 KB Output is correct
6 Correct 470 ms 23908 KB Output is correct
7 Correct 297 ms 23904 KB Output is correct
8 Correct 242 ms 23908 KB Output is correct
9 Correct 495 ms 23956 KB Output is correct
10 Correct 134 ms 23892 KB Output is correct
11 Correct 138 ms 23892 KB Output is correct
12 Correct 175 ms 23904 KB Output is correct
13 Correct 268 ms 23892 KB Output is correct
14 Correct 159 ms 23900 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 14 ms 23764 KB Output is correct
3 Incorrect 139 ms 32592 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23764 KB Output is correct
2 Incorrect 105 ms 31540 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Incorrect 125 ms 32512 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 15 ms 23764 KB Output is correct
3 Correct 14 ms 23764 KB Output is correct
4 Correct 336 ms 23904 KB Output is correct
5 Correct 282 ms 24012 KB Output is correct
6 Correct 470 ms 23908 KB Output is correct
7 Correct 297 ms 23904 KB Output is correct
8 Correct 242 ms 23908 KB Output is correct
9 Correct 495 ms 23956 KB Output is correct
10 Correct 134 ms 23892 KB Output is correct
11 Correct 138 ms 23892 KB Output is correct
12 Correct 175 ms 23904 KB Output is correct
13 Correct 268 ms 23892 KB Output is correct
14 Correct 159 ms 23900 KB Output is correct
15 Correct 14 ms 23764 KB Output is correct
16 Correct 14 ms 23764 KB Output is correct
17 Incorrect 139 ms 32592 KB Output isn't correct
18 Halted 0 ms 0 KB -