Submission #146162

#	Time	Username	Problem	Language	Result	Execution time	Memory
146162		evpipis	Tug of War (BOI15_tug)	C++11	18 / 100	149 ms	3196 KiB

tug

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef pair<int, int> ii;

const int len = 6e4+4, zer = 3e5;
int vis[len], par[len], dep[len], cost[len], cnt;
vector<ii> adj[len], vec;
bitset<2*zer+1> bit;

int check(int u){
    vis[u] = 1;

    int ans = 2-adj[u].size();
    for (int j = 0; j < adj[u].size(); j++){
        ii v = adj[u][j];
        if (!vis[v.fi])
            ans += check(v.fi);
    }

    return ans;
}

ii dfs(int u){
    vis[u] = ++cnt;

    ii ans = mp(0, 0);
    for (int j = 0; j < adj[u].size(); j++){
        ii v = adj[u][j];
        if (!vis[v.fi]){
            //printf("front edge: u = %d, v.se = %d\n", u, v.se);
            par[v.fi] = v.se;
            if (u&1)
                dep[v.fi] = dep[u]+cost[v.se], ans.fi += cost[v.se];
            else
                dep[v.fi] = dep[u]-cost[v.se], ans.fi -= cost[v.se];

            ii cur = dfs(v.fi);
            ans.fi += cur.fi;
            ans.se += cur.se;
        }
        else if (vis[v.fi] < vis[u] && par[u] != v.se){
            //printf("back edge: u = %d, v.se = %d\n", u, v.se);
            int ed = -cost[v.se];
            if (u&1)
                ed = cost[v.se];

            ans.se += dep[u]-dep[v.fi]+ed;
            ans.fi += ed-ans.se;
        }
    }

    //printf("u = %d, dep = %d, ans = (%d, %d)\n", u, dep[u], ans.fi, ans.se);
    return ans;
}

int main(){
    int n, k;
    scanf("%d %d", &n, &k);
    for (int i = 1; i <= 2*n; i++){
        int a, b, c;
        scanf("%d %d %d", &a, &b, &c);
        cost[i] = c;
        adj[2*a-2].pb(mp(2*b-1, i));
        adj[2*b-1].pb(mp(2*a-2, i));
    }

    for (int i = 1; i <= n; i++)
        if (!vis[2*i-2] && check(2*i-2) != 0){
            printf("NO\n");
            return 0;
        }

    for (int i = 0; i < 2*n; i++)
        vis[i] = 0;
    for (int i = 1; i <= n; i++)
        if (!vis[2*i-2])
            vec.pb(dfs(2*i-2));

    for (int i = 0; i < vec.size(); i++)
        vec[i].se = abs(vec[i].se);

    //for (int i = 0; i < vec.size(); i++)
      //  printf("(%d, %d)\n", vec[i].fi, vec[i].se);

    //vec.clear();
    //for (int i = 0; i < 100; i++)
      //  vec.pb(mp(0, 0));

    bit[zer] = 1;
    for (int i = 0; i < vec.size(); i++){
        if (vec[i].fi > 0)
            bit >>= (vec[i].fi);
        else if (vec[i].fi < 0)
            bit <<= (-vec[i].fi);

        if (vec[i].se)
            bit = (bit>>vec[i].se)|(bit<<vec[i].se);
    }

    for (int i = max(0, zer-k); i <= min(2*zer, zer+k); i++)
        if (bit[i]){
            printf("YES\n");
            return 0;
        }

    printf("NO\n");
    return 0;
}

Compilation message (stderr)

tug.cpp: In function 'int check(int)':
tug.cpp:19:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int j = 0; j < adj[u].size(); j++){
                     ~~^~~~~~~~~~~~~~~
tug.cpp: In function 'ii dfs(int)':
tug.cpp:32:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int j = 0; j < adj[u].size(); j++){
                     ~~^~~~~~~~~~~~~~~
tug.cpp: In function 'int main()':
tug.cpp:84:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < vec.size(); i++)
                     ~~^~~~~~~~~~~~
tug.cpp:95:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < vec.size(); i++){
                     ~~^~~~~~~~~~~~
tug.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~~
tug.cpp:66:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &a, &b, &c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 18 / 18
• Subtask 2: 0 / 30
• Subtask 3: 0 / 23
• Subtask 4: 0 / 29