oj.uz

Submission #366992

# Submission time Handle Problem Language Result Execution time Memory
366992 2021-02-16T00:54:35 Z gmyu Tug of War (BOI15_tug) C++14
71 / 100
 1540 ms 12780 KB 
/*
ID: USACO_template
LANG: C++
PROG: https://oj.uz/problem/view/BOI15_tug
*/
#include <iostream>  //cin , cout
#include <fstream>   //fin, fout
#include <stdio.h>   // scanf , pringf
#include <cstdio>
#include <algorithm> // sort , stuff
#include <stack>     // stacks
#include <queue>     // queues
#include <map>
#include <string>
#include <string.h>
#include <set>
#include <bitset>

using namespace std;

typedef pair<int, int>          pii;
typedef vector<int>             vi;     /// adjlist without weight
typedef vector<pii>             vii;    /// adjlist with weight
typedef vector<pair<int,pii>>   vpip;   /// edge with weight
typedef long long               ll;

#define mp  make_pair
#define ff  first
#define ss  second
#define pb  push_back
#define sz(x)   (int)(x).size()
#define adjread {int a, b; cin >> a >> b; adjlist[a].pb(b); adjlist[b].pb(a); }

const int MOD = 1e9+7;  // 998244353;
const int MX  = 2e5+5;   //
const ll  INF = 1e18;    //

#define MAXV 30007
#define MAXE 100007

const int xdir[4] = {1,0,-1,0}, ydir[4] = {0,1,0,-1}; /// 4 directions
struct NODE {
    int x, y;
    int val;
    int visited;
    bool operator< (NODE b) const { return (x == b.x) ? (y < b.y) : (x < b.x); }
};
struct EDGE {
    int from, to;
    ll weight;
    bool operator<(EDGE other) const { return weight < other.weight; }
};

bool debug;

int N, Klim;
vii adjlist[2][MAXV];
int marked[2][MAXV];
int s[2*MAXV];
int d0;

int roomCt;
int roomID[2][MAXV];
vii room[MAXV];
int deltaroom[MAXV];
void floodfill(int j, int i) {
    if(roomID[j][i] != 0) return;
    roomID[j][i] = roomCt;
    room[roomCt].pb(mp(j, i));
    for(auto x : adjlist[j][i]) {
        floodfill((j+1)%2, x.ff);
    }
}
int visited[2][MAXV];
int floodcal(int rm, pii v, int sel, int vis) {
    if(visited[v.ff][v.ss] == vis) return 0;
    visited[v.ff][v.ss] = vis;
    int d = adjlist[v.ff][v.ss][sel].ss * ( (v.ff==0)? 1 : (-1));
    if(debug) cout << v.ff << "," << v.ss << " assigned " << d << endl;
    int j1 = (v.ff+1)%2, i1 = adjlist[v.ff][v.ss][(sel+1)%2].ff;

    int sel1;
    if(adjlist[j1][i1][0].ff == v.ss && adjlist[j1][i1][0].ss == adjlist[v.ff][v.ss][(sel+1)%2].ss ) sel1 = 0;
    else sel1 = 1;
    d += floodcal(rm, mp(j1, i1), sel1, vis);
    return d;
}

int main() {
    debug = false;
    ios_base::sync_with_stdio(false); cin.tie(0);

    int i, j, k;
    int ans = 0;

    cin >> N >> Klim;
    for(i=1;i<=2*N;i++) {
        int a, b, c; cin >> a >> b >> c;
        adjlist[0][a].pb(mp(b,c)); adjlist[1][b].pb(mp(a,c));
    }

    /// remove single points
    bool hasSingle = true;
    while(hasSingle) {
        hasSingle = false;
        for(i=1; i<=N;i++) {
            for(j=0;j<2;j++) {
                if(marked[j][i]) continue;
                if(sz(adjlist[j][i])==0) {cout << "NO" << endl; exit(0);}
                if(sz(adjlist[j][i])==1) {
                    marked[j][i] = 1;
                    d0 += adjlist[j][i][0].ss * ((j==0)? 1 : (-1) );
                    int j1 = (j+1)%2, i1 = adjlist[j][i][0].ff;
                    for(k=0; k<sz(adjlist[j1][i1]) && adjlist[j1][i1][k].ff !=i; k++ );
                    adjlist[j1][i1].erase(adjlist[j1][i1].begin()+k);
                    hasSingle=true;
                    if(debug) cout << j << " " << i << " is single " << endl;
                }
            }
        }
    }

    /// assign cycle
    for(i=1;i<=N;i++)
        for(j=0;j<2;j++) {
            if(marked[j][i]) continue;
            if(roomID[j][i] != 0) continue;
            roomCt++;
            floodfill(j, i);
        }
    for(i=1; i<= roomCt; i++) {
        if(debug) cout << endl << "room " << i << endl;
        int d1 = floodcal(i, room[i][0], 0, 1);
        int d2 = floodcal(i, room[i][0], 1, 2);
        d0 += d1;
        deltaroom[i] = d2 - d1;
    }

    /// DP the assignment
    bitset<1200007> dp;
    int offset = 60001;
    dp[offset+d0]=1;
    if(debug) cout << d0 << endl;
    for(i=1;i<=roomCt;i++) {
        if(debug) cout << deltaroom[i] << endl;
        if(deltaroom[i]>=0) dp |= (dp << deltaroom[i]);
        else dp |= (dp >> (-deltaroom[i]));
    }
    for(i=0;i<=Klim;i++)
        if(dp[offset+i]==1 | dp[offset-i]==1)  {cout << "YES" << endl; exit(0);}


    cout << "NO" << endl;

}

Compilation message

tug.cpp: In function 'int main()':
tug.cpp:150:24: warning: suggest parentheses around comparison in operand of '|' [-Wparentheses]
  150 |         if(dp[offset+i]==1 | dp[offset-i]==1)  {cout << "YES" << endl; exit(0);}
tug.cpp:94:9: warning: unused variable 'ans' [-Wunused-variable]
   94 |     int ans = 0;
      |         ^~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2924 KB Output is correct
2 Correct 3 ms 2924 KB Output is correct
3 Correct 3 ms 2924 KB Output is correct
4 Correct 4 ms 2924 KB Output is correct
5 Correct 3 ms 2924 KB Output is correct
6 Correct 3 ms 2924 KB Output is correct
7 Correct 3 ms 2924 KB Output is correct
8 Correct 3 ms 2924 KB Output is correct
9 Correct 3 ms 2924 KB Output is correct
10 Correct 4 ms 2924 KB Output is correct
11 Correct 3 ms 2924 KB Output is correct
12 Correct 3 ms 2924 KB Output is correct
13 Correct 3 ms 2924 KB Output is correct
14 Correct 3 ms 2924 KB Output is correct
15 Correct 3 ms 2924 KB Output is correct
16 Correct 3 ms 2924 KB Output is correct
17 Correct 3 ms 2924 KB Output is correct
18 Correct 3 ms 2924 KB Output is correct
19 Correct 3 ms 2924 KB Output is correct
20 Correct 3 ms 2924 KB Output is correct
21 Correct 2 ms 2424 KB Output is correct
22 Correct 2 ms 2924 KB Output is correct
23 Correct 3 ms 2924 KB Output is correct
24 Correct 3 ms 2924 KB Output is correct
25 Correct 3 ms 2924 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2924 KB Output is correct
2 Correct 3 ms 2924 KB Output is correct
3 Correct 3 ms 2924 KB Output is correct
4 Correct 4 ms 2924 KB Output is correct
5 Correct 3 ms 2924 KB Output is correct
6 Correct 3 ms 2924 KB Output is correct
7 Correct 3 ms 2924 KB Output is correct
8 Correct 3 ms 2924 KB Output is correct
9 Correct 3 ms 2924 KB Output is correct
10 Correct 4 ms 2924 KB Output is correct
11 Correct 3 ms 2924 KB Output is correct
12 Correct 3 ms 2924 KB Output is correct
13 Correct 3 ms 2924 KB Output is correct
14 Correct 3 ms 2924 KB Output is correct
15 Correct 3 ms 2924 KB Output is correct
16 Correct 3 ms 2924 KB Output is correct
17 Correct 3 ms 2924 KB Output is correct
18 Correct 3 ms 2924 KB Output is correct
19 Correct 3 ms 2924 KB Output is correct
20 Correct 3 ms 2924 KB Output is correct
21 Correct 2 ms 2424 KB Output is correct
22 Correct 2 ms 2924 KB Output is correct
23 Correct 3 ms 2924 KB Output is correct
24 Correct 3 ms 2924 KB Output is correct
25 Correct 3 ms 2924 KB Output is correct
26 Correct 102 ms 3244 KB Output is correct
27 Correct 18 ms 3180 KB Output is correct
28 Correct 102 ms 3248 KB Output is correct
29 Correct 19 ms 3180 KB Output is correct
30 Correct 101 ms 3180 KB Output is correct
31 Correct 17 ms 3180 KB Output is correct
32 Correct 100 ms 3180 KB Output is correct
33 Correct 20 ms 3308 KB Output is correct
34 Correct 11 ms 3180 KB Output is correct
35 Correct 17 ms 3180 KB Output is correct
36 Correct 110 ms 3180 KB Output is correct
37 Correct 18 ms 3308 KB Output is correct
38 Correct 100 ms 3180 KB Output is correct
39 Correct 17 ms 3180 KB Output is correct
40 Correct 107 ms 3180 KB Output is correct
41 Correct 17 ms 3180 KB Output is correct
42 Correct 117 ms 3328 KB Output is correct
43 Correct 20 ms 3180 KB Output is correct
44 Correct 101 ms 3308 KB Output is correct
45 Correct 17 ms 3180 KB Output is correct
46 Correct 100 ms 3308 KB Output is correct
47 Correct 4 ms 2668 KB Output is correct
48 Correct 53 ms 3252 KB Output is correct
49 Correct 55 ms 3308 KB Output is correct
50 Correct 102 ms 3308 KB Output is correct
51 Correct 104 ms 3308 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 4332 KB Output is correct
2 Correct 10 ms 3436 KB Output is correct
3 Correct 345 ms 4332 KB Output is correct
4 Correct 10 ms 3436 KB Output is correct
5 Correct 329 ms 4332 KB Output is correct
6 Correct 10 ms 3564 KB Output is correct
7 Correct 334 ms 4332 KB Output is correct
8 Correct 10 ms 3436 KB Output is correct
9 Correct 331 ms 4332 KB Output is correct
10 Correct 10 ms 3436 KB Output is correct
11 Correct 331 ms 4332 KB Output is correct
12 Correct 10 ms 3436 KB Output is correct
13 Correct 331 ms 4332 KB Output is correct
14 Correct 337 ms 4332 KB Output is correct
15 Correct 13 ms 3436 KB Output is correct
16 Correct 329 ms 4332 KB Output is correct
17 Correct 10 ms 3436 KB Output is correct
18 Correct 327 ms 4332 KB Output is correct
19 Correct 10 ms 3436 KB Output is correct
20 Correct 338 ms 4332 KB Output is correct
21 Correct 10 ms 3436 KB Output is correct
22 Correct 169 ms 4332 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2924 KB Output is correct
2 Correct 3 ms 2924 KB Output is correct
3 Correct 3 ms 2924 KB Output is correct
4 Correct 4 ms 2924 KB Output is correct
5 Correct 3 ms 2924 KB Output is correct
6 Correct 3 ms 2924 KB Output is correct
7 Correct 3 ms 2924 KB Output is correct
8 Correct 3 ms 2924 KB Output is correct
9 Correct 3 ms 2924 KB Output is correct
10 Correct 4 ms 2924 KB Output is correct
11 Correct 3 ms 2924 KB Output is correct
12 Correct 3 ms 2924 KB Output is correct
13 Correct 3 ms 2924 KB Output is correct
14 Correct 3 ms 2924 KB Output is correct
15 Correct 3 ms 2924 KB Output is correct
16 Correct 3 ms 2924 KB Output is correct
17 Correct 3 ms 2924 KB Output is correct
18 Correct 3 ms 2924 KB Output is correct
19 Correct 3 ms 2924 KB Output is correct
20 Correct 3 ms 2924 KB Output is correct
21 Correct 2 ms 2424 KB Output is correct
22 Correct 2 ms 2924 KB Output is correct
23 Correct 3 ms 2924 KB Output is correct
24 Correct 3 ms 2924 KB Output is correct
25 Correct 3 ms 2924 KB Output is correct
26 Correct 102 ms 3244 KB Output is correct
27 Correct 18 ms 3180 KB Output is correct
28 Correct 102 ms 3248 KB Output is correct
29 Correct 19 ms 3180 KB Output is correct
30 Correct 101 ms 3180 KB Output is correct
31 Correct 17 ms 3180 KB Output is correct
32 Correct 100 ms 3180 KB Output is correct
33 Correct 20 ms 3308 KB Output is correct
34 Correct 11 ms 3180 KB Output is correct
35 Correct 17 ms 3180 KB Output is correct
36 Correct 110 ms 3180 KB Output is correct
37 Correct 18 ms 3308 KB Output is correct
38 Correct 100 ms 3180 KB Output is correct
39 Correct 17 ms 3180 KB Output is correct
40 Correct 107 ms 3180 KB Output is correct
41 Correct 17 ms 3180 KB Output is correct
42 Correct 117 ms 3328 KB Output is correct
43 Correct 20 ms 3180 KB Output is correct
44 Correct 101 ms 3308 KB Output is correct
45 Correct 17 ms 3180 KB Output is correct
46 Correct 100 ms 3308 KB Output is correct
47 Correct 4 ms 2668 KB Output is correct
48 Correct 53 ms 3252 KB Output is correct
49 Correct 55 ms 3308 KB Output is correct
50 Correct 102 ms 3308 KB Output is correct
51 Correct 104 ms 3308 KB Output is correct
52 Correct 331 ms 4332 KB Output is correct
53 Correct 10 ms 3436 KB Output is correct
54 Correct 345 ms 4332 KB Output is correct
55 Correct 10 ms 3436 KB Output is correct
56 Correct 329 ms 4332 KB Output is correct
57 Correct 10 ms 3564 KB Output is correct
58 Correct 334 ms 4332 KB Output is correct
59 Correct 10 ms 3436 KB Output is correct
60 Correct 331 ms 4332 KB Output is correct
61 Correct 10 ms 3436 KB Output is correct
62 Correct 331 ms 4332 KB Output is correct
63 Correct 10 ms 3436 KB Output is correct
64 Correct 331 ms 4332 KB Output is correct
65 Correct 337 ms 4332 KB Output is correct
66 Correct 13 ms 3436 KB Output is correct
67 Correct 329 ms 4332 KB Output is correct
68 Correct 10 ms 3436 KB Output is correct
69 Correct 327 ms 4332 KB Output is correct
70 Correct 10 ms 3436 KB Output is correct
71 Correct 338 ms 4332 KB Output is correct
72 Correct 10 ms 3436 KB Output is correct
73 Correct 169 ms 4332 KB Output is correct
74 Correct 1514 ms 7196 KB Output is correct
75 Correct 96 ms 6764 KB Output is correct
76 Correct 1486 ms 7276 KB Output is correct
77 Correct 99 ms 6764 KB Output is correct
78 Correct 1540 ms 7340 KB Output is correct
79 Correct 1523 ms 7180 KB Output is correct
80 Correct 104 ms 6764 KB Output is correct
81 Correct 102 ms 6636 KB Output is correct
82 Runtime error 35 ms 12780 KB Execution killed with signal 7
83 Halted 0 ms 0 KB -