oj.uz

Submission #871499

# Submission time Handle Problem Language Result Execution time Memory
871499 2023-11-11T04:19:16 Z 1075508020060209tc Tug of War (BOI15_tug) C++14
0 / 100
 3000 ms 34196 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 n;int K;
vector<int>e[500005];
int ar[500005];int br[500005];int cr[500005];
int vise[500005];
int vis[500005];
int ok;
int dvis[500005];
vector<int>vc;
void dfs(int nw){
dvis[nw]=1;
vc.push_back(nw);
for(int i=0;i<e[nw].size();i++){
    int id=e[nw][i];
    if(vise[id]){continue;}
    int v=nw^ar[id]^br[id];
    if(vis[v]){ok=0;return;}
    vise[id]=v;
    vis[v]=id;
    dfs(v);
}


}

int dp[2][600005];
vector<int>chok(int pl){
vector<int>ret;
for(int i=0;i<e[pl].size();i++){
    vise[e[pl][i]]=pl;
    vis[pl]=e[pl][i];
    ok=1;
    dfs(pl);
    int tot=0;
    for(int j=1;j<=n;j++){
        if(vis[j]){

            tot+=cr[vis[j]];
        }
    }
    for(int j=0;j<vc.size();j++){
        if(vis[vc[j] ]==0){ok=0;}
    }
    vc.clear();

    if(ok){
        ret.push_back(tot);
    }
    for(int j=1;j<=n+n;j++){
        vis[j]=0;vise[j]=0;
    }
}
if(ret.size()==0){
    cout<<"NO\n";
}
return ret;
}

vector<vector<int>>var;
int tot;
signed main(){
cin>>n>>K;
for(int i=1;i<=n+n;i++){
    int a;int b;int c;
    cin>>a>>b>>c;
    e[a].push_back(i);
    e[b+n].push_back(i);
    ar[i]=a;br[i]=b+n;cr[i]=c;
    tot+=c;
}
for(int i=1;i<=n+n;i++){
    if(dvis[i]){continue;}
    var.push_back(chok(i));
}
for(int i=0;i<var[0].size();i++){
    dp[0][var[0][i]]=1;
  //  cout<<var[0][i]<<"\n";
}
/*
for(int i=0;i<=6;i++){
    cout<<dp[0][i];
}*/

for(int i=1;i<var.size();i++){

    for(int j=0;j<var[i].size();j++){
           // cout<<var[i][j]<<"f\n";
        for(int k=0;k<=n*40;k++){
            if( var[i][j]<=k&&dp[0][k-var[i][j]] ){
                dp[1][k]=1;
            }
        }
    }
    for(int k=0;k<=n*40;k++){
        dp[0][k]=dp[1][k];
        dp[1][k]=0;
    }
}
for(int i=0;i<=n*40;i++){
   // cout<<dp[0][i]<<"\n";
    if( dp[0][i]&&abs(tot-i-i)<=K){
        cout<<"YES\n";return 0;
    }
}
cout<<"NO\n";
}

Compilation message

tug.cpp: In function 'void dfs(long long int)':
tug.cpp:20: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]
   20 | for(int i=0;i<e[nw].size();i++){
      |             ~^~~~~~~~~~~~~
tug.cpp: In function 'std::vector<long long int> chok(long long int)':
tug.cpp:36: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]
   36 | for(int i=0;i<e[pl].size();i++){
      |             ~^~~~~~~~~~~~~
tug.cpp:48: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]
   48 |     for(int j=0;j<vc.size();j++){
      |                 ~^~~~~~~~~~
tug.cpp: In function 'int main()':
tug.cpp:82: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]
   82 | for(int i=0;i<var[0].size();i++){
      |             ~^~~~~~~~~~~~~~
tug.cpp:91:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 | for(int i=1;i<var.size();i++){
      |             ~^~~~~~~~~~~
tug.cpp:93: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]
   93 |     for(int j=0;j<var[i].size();j++){
      |                 ~^~~~~~~~~~~~~~

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 28248 KB Output is correct
2 Correct 5 ms 28248 KB Output is correct
3 Correct 5 ms 28252 KB Output is correct
4 Correct 5 ms 28248 KB Output is correct
5 Correct 5 ms 28252 KB Output is correct
6 Correct 5 ms 28252 KB Output is correct
7 Correct 5 ms 28252 KB Output is correct
8 Correct 5 ms 28288 KB Output is correct
9 Correct 5 ms 28252 KB Output is correct
10 Correct 5 ms 28252 KB Output is correct
11 Correct 5 ms 28252 KB Output is correct
12 Correct 5 ms 28252 KB Output is correct
13 Correct 5 ms 28464 KB Output is correct
14 Correct 5 ms 28248 KB Output is correct
15 Correct 5 ms 28252 KB Output is correct
16 Correct 5 ms 28248 KB Output is correct
17 Correct 5 ms 28252 KB Output is correct
18 Correct 6 ms 28252 KB Output is correct
19 Correct 5 ms 28252 KB Output is correct
20 Correct 5 ms 28248 KB Output is correct
21 Incorrect 5 ms 26200 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 28248 KB Output is correct
2 Correct 5 ms 28248 KB Output is correct
3 Correct 5 ms 28252 KB Output is correct
4 Correct 5 ms 28248 KB Output is correct
5 Correct 5 ms 28252 KB Output is correct
6 Correct 5 ms 28252 KB Output is correct
7 Correct 5 ms 28252 KB Output is correct
8 Correct 5 ms 28288 KB Output is correct
9 Correct 5 ms 28252 KB Output is correct
10 Correct 5 ms 28252 KB Output is correct
11 Correct 5 ms 28252 KB Output is correct
12 Correct 5 ms 28252 KB Output is correct
13 Correct 5 ms 28464 KB Output is correct
14 Correct 5 ms 28248 KB Output is correct
15 Correct 5 ms 28252 KB Output is correct
16 Correct 5 ms 28248 KB Output is correct
17 Correct 5 ms 28252 KB Output is correct
18 Correct 6 ms 28252 KB Output is correct
19 Correct 5 ms 28252 KB Output is correct
20 Correct 5 ms 28248 KB Output is correct
21 Incorrect 5 ms 26200 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3046 ms 34196 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 28248 KB Output is correct
2 Correct 5 ms 28248 KB Output is correct
3 Correct 5 ms 28252 KB Output is correct
4 Correct 5 ms 28248 KB Output is correct
5 Correct 5 ms 28252 KB Output is correct
6 Correct 5 ms 28252 KB Output is correct
7 Correct 5 ms 28252 KB Output is correct
8 Correct 5 ms 28288 KB Output is correct
9 Correct 5 ms 28252 KB Output is correct
10 Correct 5 ms 28252 KB Output is correct
11 Correct 5 ms 28252 KB Output is correct
12 Correct 5 ms 28252 KB Output is correct
13 Correct 5 ms 28464 KB Output is correct
14 Correct 5 ms 28248 KB Output is correct
15 Correct 5 ms 28252 KB Output is correct
16 Correct 5 ms 28248 KB Output is correct
17 Correct 5 ms 28252 KB Output is correct
18 Correct 6 ms 28252 KB Output is correct
19 Correct 5 ms 28252 KB Output is correct
20 Correct 5 ms 28248 KB Output is correct
21 Incorrect 5 ms 26200 KB Output isn't correct
22 Halted 0 ms 0 KB -