oj.uz

Submission #573283

# Submission time Handle Problem Language Result Execution time Memory
573283 2022-06-06T11:08:04 Z AmirElarbi Stranded Far From Home (BOI22_island) C++14
0 / 100
 56 ms 60852 KB 
#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e9+7
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 2e5+5
using namespace std;
const int MOD = 1e4+7;
const int nax = 2e5+5;
typedef complex<int> Point;
#define X real()
#define Y imag()
vii s;
vi adj[nax], nds[nax];
ll ans[nax];
ll vl[nax], p[nax], sz[nax];
int find_set(int v) {
    if (v == p[v])
        return v;
    return p[v] = find_set(p[v]);
}

void union_sets(int a, int b) {
    a = find_set(a);
    b = find_set(b);
    if (a != b){
        //if(nds[b].size() > nds[a].size()) swap(nds[a],nds[b]);
        for(auto x : nds[b]) nds[a].pb(x);
        p[b] = a;
        sz[a] += sz[b];
    }
}
int main(){
    optimise;
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    int n,m;
    cin >>n >> m;
    for (int i = 0; i < n; ++i)
    {
        int val;
        cin >> val;
        sz[i] = val;
        p[i] = i;
        nds[i].pb(i);
        s.pb({val,i});
    }
    for (int i = 0; i < m; ++i)
    {
        int a,b;
        cin >> a >> b;
        a--,b--;
        if(mp(sz[a],a) < mp(sz[b],b) ) swap(a,b);
        adj[a].pb(b);
    }
    sort(s.begin(), s.end());
    for (int i = 0; i < n; ++i)
    {
        int u = find_set(s[i].se);
        for(auto x : adj[u]){
            x = find_set(x);
            if(sz[u] > sz[x]) nds[x].clear();
        }
        for(auto x : adj[u]) union_sets(x,u);  
    }
    for(auto x: nds[find_set(0)])
        ans[x] = 1;
    for (int i = 0; i < n; ++i)
    {
        cout << ans[i];
    }
}

Compilation message

island.cpp: In function 'int main()':
island.cpp:49:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
island.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 15 ms 19668 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 56 ms 60848 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 56 ms 60852 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 16 ms 19584 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 15 ms 19668 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -