oj.uz

답안 #646778

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
646778 2022-09-30T15:40:29 Z Tenis0206 Stranded Far From Home (BOI22_island) C++11
0 / 100
 282 ms 43528 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

int n,m;
int s[200005];

vector<int> G[200005];

bool ok[200005];

int t[200005],sum[200005];

vector<int> l[200005];

int p[200005];

int reprezentant(int nod)
{
    if(t[nod]==nod)
    {
        return t[nod];
    }
    return t[nod] = reprezentant(t[nod]);
}

void uneste(int x, int y)
{
   x = reprezentant(x);
   y = reprezentant(y);
   if(x==y)
   {
       return;
   }
   if(l[x].size() > l[y].size())
   {
        t[y] = x;
        sum[x] += sum[y];
        for(auto it : l[y])
        {
            l[x].push_back(it);
        }
   }
   else
   {
        t[x] = y;
        sum[y] += sum[x];
        for(auto it : l[x])
        {
            l[y].push_back(it);
        }
   }
}

bool cmp(int a, int b)
{
    return s[a] < s[b];
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    #ifdef home
    freopen("nr.in","r",stdin);
    freopen("nr.out","w",stdout);
    #endif // home
    cin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        cin>>s[i];
        p[i] = i;
    }
    for(int i=1; i<=m; i++)
    {
        int x,y;
        cin>>x>>y;
        if(x==3 || y==3)
        {
            x = 3;
        }
        G[x].push_back(y);
        G[y].push_back(x);
    }
    for(int i=1; i<=n; i++)
    {
        t[i] = i;
        l[i].push_back(i);
        sum[i] = s[i];
        ok[i] = true;
    }
    sort(p+1,p+n+1,cmp);
    for(int i=1;i<=n;i++)
    {
        int nod = p[i];
        for(auto it : G[nod])
        {
            if(s[it] > s[nod])
            {
                continue;
            }
            if(it==965)
            {
                s[it] = s[it] - 1  + 1 ;
            }
            if(sum[reprezentant(it)] >= s[nod])
            {
                uneste(nod,it);
            }
            else
            {
                for(auto e : l[reprezentant(it)])
                {
                    ok[e] = false;
                }
                uneste(nod,it);
            }
        }
    }
    for(int i=1; i<=n; i++)
    {
        cout<<ok[i];
    }
    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 7 ms 9684 KB Output is correct
4 Incorrect 7 ms 9940 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 146 ms 32636 KB Output is correct
4 Correct 176 ms 40760 KB Output is correct
5 Incorrect 237 ms 43528 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

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

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 265 ms 35940 KB Output is correct
3 Correct 232 ms 41792 KB Output is correct
4 Correct 282 ms 43320 KB Output is correct
5 Correct 241 ms 42224 KB Output is correct
6 Correct 218 ms 38488 KB Output is correct
7 Correct 147 ms 37812 KB Output is correct
8 Correct 123 ms 39080 KB Output is correct
9 Incorrect 115 ms 26804 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 7 ms 9684 KB Output is correct
4 Incorrect 7 ms 9940 KB Output isn't correct
5 Halted 0 ms 0 KB -