oj.uz

답안 #871802

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
871802 2023-11-11T15:46:47 Z 1075508020060209tc Tug of War (BOI15_tug) C++14
18 / 100
 350 ms 30044 KB 
//#pragma GCC optimize ("O3")
#include<bits/stdc++.h>
//#include <bits/extc++.h>
//using namespace __gnu_pbds;
using namespace std;
#define int long long
#define X first
#define Y second
int lowbit(int x){return x&-x;}
int n;int K;
vector<int>e[500005];
int vis[500005];
int vise[500005];
int dgr[500005];
int ar[500005];int br[500005];int cr[500005];
int basea;
int baseb;
bitset<600005>dp;
bitset<600005>dp2;
bitset<600005>zer;
int tota;int totb;
int tp;
void dfs(int nw){
vis[nw]=1;
//cout<<nw<<"kk"<<endl;
int cnt=0;
for(int i=0;i<e[nw].size();i++){
    int id=e[nw][i];
    if(vise[id]){continue;}
    if(tp==0){
        tota+=cr[id];
    }else{
        totb+=cr[id];
    }
    vise[id]=1;
    int v=nw^ar[id]^br[id];
    tp^=1;
    cnt++;
    dfs(v);
}
if(cnt>=2){
    exit(cnt);
}

}

int uf[500005];
int usz[500005];
int ues[500005];

int fin(int x){
if(uf[x]==x){return x;}
uf[x]=fin(uf[x]);
return uf[x];
}
void mrg(int a,int b){
int pa=fin(a);int pb=fin(b);
ues[pa]++;
if(pa==pb){return;}
usz[pa]+=usz[pb];
ues[pa]+=ues[pb];
uf[pb]=pa;
}


signed main(){
cin>>n>>K;
int ftot=0;
for(int i=1;i<=n+n;i++){
    int a;int b;int c;
    cin>>a>>b>>c;
    b+=n;
    ar[i]=a;br[i]=b;cr[i]=c;
    ftot+=c;
    dgr[a]++;
    dgr[b]++;
    e[a].push_back(i);
    e[b].push_back(i);
}

for(int i=1;i<=n+n;i++){
    if(dgr[i]==0){
        cout<<"NO\n";return 0;
    }
}

for(int i=1;i<=n+n;i++){
    uf[i]=i;
    usz[i]=1;
    ues[i]=0;
}
for(int i=1;i<=n+n;i++){
    //if(vise[i]){continue;}
    mrg(ar[i],br[i]);
}
for(int i=1;i<=n+n;i++){
    //if(vis[i]){continue;}
    if( usz[fin(i)]!=ues[fin(i)] ){
        cout<<"NO\n";return 0;
    }
}


queue<int>q;
for(int i=1;i<=n+n;i++){
    if(dgr[i]==1){
        q.push(i);
        vise[e[i][0]]=1;
        if( i<=n ){
            basea+=cr[e[i][0]];
        }
        vis[i]=1;
    }
}
while(q.size()){
    int nw=q.front();
    q.pop();
    vis[nw]=1;
    for(int i=0;i<e[nw].size();i++){
        int id=e[nw][i];
        if(vise[id]){continue;}
        int v=ar[i]^br[i]^nw;
        dgr[v]--;
        if(dgr[v]==1){
            for(int j=0;j<e[v].size();j++){
                int idd=e[v][j];
                if(vise[idd]){continue;}
                if(v<=n){
                    basea+=cr[idd];
                }
                vise[idd]=1;
            }
            q.push(v);
        }
    }
}/*
cout<<basea<<"\n";
for(int i=1;i<=n+n;i++){
    cout<<vis[i]<<" ";
}cout<<endl;
for(int i=1;i<=n+n;i++){
    cout<<vise[i]<<" ";
}*/



vector<pair<int,int>>vc;

for(int i=1;i<=n;i++){
    if(vis[i]){continue;}
    tota=0;
    totb=0;
    tp=0;
    dfs(i);
    vc.push_back({tota,totb});
}
dp[basea]=1;
for(int i=0;i<vc.size();i++){
    dp2=(dp<<vc[i].first);
    dp2=(dp2|(dp<<vc[i].second));
    swap(dp,dp2);
    dp2=zer;
}
for(int i=0;i<=n*20;i++){
    if(dp[i]&&(abs(ftot-i-i)<=K)){
        cout<<"YES\n";return 0;
    }
}
cout<<"NO\n";

}

Compilation message

tug.cpp: In function 'void dfs(long long int)':
tug.cpp:27:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 | for(int i=0;i<e[nw].size();i++){
      |             ~^~~~~~~~~~~~~
tug.cpp: In function 'int main()':
tug.cpp:119:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |     for(int i=0;i<e[nw].size();i++){
      |                 ~^~~~~~~~~~~~~
tug.cpp:125:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |             for(int j=0;j<e[v].size();j++){
      |                         ~^~~~~~~~~~~~
tug.cpp:158:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  158 | for(int i=0;i<vc.size();i++){
      |             ~^~~~~~~~~~

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 24924 KB Output is correct
2 Correct 6 ms 24924 KB Output is correct
3 Correct 6 ms 24924 KB Output is correct
4 Correct 5 ms 24924 KB Output is correct
5 Correct 5 ms 24924 KB Output is correct
6 Correct 6 ms 24924 KB Output is correct
7 Correct 5 ms 24924 KB Output is correct
8 Correct 5 ms 25012 KB Output is correct
9 Correct 6 ms 24924 KB Output is correct
10 Correct 5 ms 25036 KB Output is correct
11 Correct 5 ms 25032 KB Output is correct
12 Correct 5 ms 24924 KB Output is correct
13 Correct 5 ms 24924 KB Output is correct
14 Correct 5 ms 24924 KB Output is correct
15 Correct 5 ms 25016 KB Output is correct
16 Correct 5 ms 24924 KB Output is correct
17 Correct 5 ms 24924 KB Output is correct
18 Correct 5 ms 24924 KB Output is correct
19 Correct 5 ms 24924 KB Output is correct
20 Correct 5 ms 25036 KB Output is correct
21 Correct 4 ms 20828 KB Output is correct
22 Correct 5 ms 29020 KB Output is correct
23 Correct 5 ms 29020 KB Output is correct
24 Correct 5 ms 24924 KB Output is correct
25 Correct 5 ms 24924 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 24924 KB Output is correct
2 Correct 6 ms 24924 KB Output is correct
3 Correct 6 ms 24924 KB Output is correct
4 Correct 5 ms 24924 KB Output is correct
5 Correct 5 ms 24924 KB Output is correct
6 Correct 6 ms 24924 KB Output is correct
7 Correct 5 ms 24924 KB Output is correct
8 Correct 5 ms 25012 KB Output is correct
9 Correct 6 ms 24924 KB Output is correct
10 Correct 5 ms 25036 KB Output is correct
11 Correct 5 ms 25032 KB Output is correct
12 Correct 5 ms 24924 KB Output is correct
13 Correct 5 ms 24924 KB Output is correct
14 Correct 5 ms 24924 KB Output is correct
15 Correct 5 ms 25016 KB Output is correct
16 Correct 5 ms 24924 KB Output is correct
17 Correct 5 ms 24924 KB Output is correct
18 Correct 5 ms 24924 KB Output is correct
19 Correct 5 ms 24924 KB Output is correct
20 Correct 5 ms 25036 KB Output is correct
21 Correct 4 ms 20828 KB Output is correct
22 Correct 5 ms 29020 KB Output is correct
23 Correct 5 ms 29020 KB Output is correct
24 Correct 5 ms 24924 KB Output is correct
25 Correct 5 ms 24924 KB Output is correct
26 Correct 67 ms 25180 KB Output is correct
27 Correct 15 ms 25176 KB Output is correct
28 Correct 73 ms 25180 KB Output is correct
29 Correct 15 ms 25180 KB Output is correct
30 Correct 66 ms 25180 KB Output is correct
31 Correct 15 ms 25060 KB Output is correct
32 Correct 69 ms 25300 KB Output is correct
33 Correct 15 ms 25180 KB Output is correct
34 Correct 12 ms 25268 KB Output is correct
35 Correct 15 ms 25180 KB Output is correct
36 Correct 69 ms 25292 KB Output is correct
37 Correct 18 ms 25432 KB Output is correct
38 Correct 69 ms 25180 KB Output is correct
39 Correct 15 ms 25180 KB Output is correct
40 Correct 66 ms 25180 KB Output is correct
41 Correct 15 ms 25272 KB Output is correct
42 Correct 66 ms 25180 KB Output is correct
43 Correct 17 ms 25176 KB Output is correct
44 Correct 79 ms 25188 KB Output is correct
45 Correct 15 ms 25188 KB Output is correct
46 Correct 66 ms 25072 KB Output is correct
47 Correct 6 ms 20836 KB Output is correct
48 Runtime error 7 ms 29284 KB Execution failed because the return code was nonzero
49 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 333 ms 26432 KB Output is correct
2 Correct 15 ms 21604 KB Output is correct
3 Correct 321 ms 26464 KB Output is correct
4 Correct 15 ms 21600 KB Output is correct
5 Correct 320 ms 26464 KB Output is correct
6 Correct 16 ms 21596 KB Output is correct
7 Correct 320 ms 26460 KB Output is correct
8 Correct 16 ms 21652 KB Output is correct
9 Correct 317 ms 26460 KB Output is correct
10 Correct 15 ms 21592 KB Output is correct
11 Correct 315 ms 26304 KB Output is correct
12 Correct 15 ms 21596 KB Output is correct
13 Correct 324 ms 26460 KB Output is correct
14 Correct 350 ms 26460 KB Output is correct
15 Correct 15 ms 21596 KB Output is correct
16 Correct 318 ms 26500 KB Output is correct
17 Correct 15 ms 21596 KB Output is correct
18 Correct 312 ms 26460 KB Output is correct
19 Correct 16 ms 21592 KB Output is correct
20 Correct 318 ms 26460 KB Output is correct
21 Correct 15 ms 21596 KB Output is correct
22 Runtime error 17 ms 30044 KB Execution failed because the return code was nonzero
23 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 24924 KB Output is correct
2 Correct 6 ms 24924 KB Output is correct
3 Correct 6 ms 24924 KB Output is correct
4 Correct 5 ms 24924 KB Output is correct
5 Correct 5 ms 24924 KB Output is correct
6 Correct 6 ms 24924 KB Output is correct
7 Correct 5 ms 24924 KB Output is correct
8 Correct 5 ms 25012 KB Output is correct
9 Correct 6 ms 24924 KB Output is correct
10 Correct 5 ms 25036 KB Output is correct
11 Correct 5 ms 25032 KB Output is correct
12 Correct 5 ms 24924 KB Output is correct
13 Correct 5 ms 24924 KB Output is correct
14 Correct 5 ms 24924 KB Output is correct
15 Correct 5 ms 25016 KB Output is correct
16 Correct 5 ms 24924 KB Output is correct
17 Correct 5 ms 24924 KB Output is correct
18 Correct 5 ms 24924 KB Output is correct
19 Correct 5 ms 24924 KB Output is correct
20 Correct 5 ms 25036 KB Output is correct
21 Correct 4 ms 20828 KB Output is correct
22 Correct 5 ms 29020 KB Output is correct
23 Correct 5 ms 29020 KB Output is correct
24 Correct 5 ms 24924 KB Output is correct
25 Correct 5 ms 24924 KB Output is correct
26 Correct 67 ms 25180 KB Output is correct
27 Correct 15 ms 25176 KB Output is correct
28 Correct 73 ms 25180 KB Output is correct
29 Correct 15 ms 25180 KB Output is correct
30 Correct 66 ms 25180 KB Output is correct
31 Correct 15 ms 25060 KB Output is correct
32 Correct 69 ms 25300 KB Output is correct
33 Correct 15 ms 25180 KB Output is correct
34 Correct 12 ms 25268 KB Output is correct
35 Correct 15 ms 25180 KB Output is correct
36 Correct 69 ms 25292 KB Output is correct
37 Correct 18 ms 25432 KB Output is correct
38 Correct 69 ms 25180 KB Output is correct
39 Correct 15 ms 25180 KB Output is correct
40 Correct 66 ms 25180 KB Output is correct
41 Correct 15 ms 25272 KB Output is correct
42 Correct 66 ms 25180 KB Output is correct
43 Correct 17 ms 25176 KB Output is correct
44 Correct 79 ms 25188 KB Output is correct
45 Correct 15 ms 25188 KB Output is correct
46 Correct 66 ms 25072 KB Output is correct
47 Correct 6 ms 20836 KB Output is correct
48 Runtime error 7 ms 29284 KB Execution failed because the return code was nonzero
49 Halted 0 ms 0 KB -