oj.uz

답안 #1022732

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1022732 2024-07-14T04:04:28 Z guagua0407 Tug of War (BOI15_tug) C++17
18 / 100
 249 ms 2392 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

const int mxn=6e4+5;
int l[mxn],r[mxn],S[mxn];
bool vis[mxn];

int main() {_
    int n,k;
    cin>>n>>k;
    vector<vector<int>> ls(n),rs(n);
    int all=0;
    for(int i=0;i<2*n;i++){
        cin>>l[i]>>r[i]>>S[i];
        all+=S[i];
        l[i]--;
        r[i]--;
        ls[l[i]].push_back(i);
        rs[r[i]].push_back(i);
    }
    for(int i=0;i<n;i++){
        if(ls[i].empty() or rs[i].empty()){
            cout<<"NO"<<'\n';
            return 0;
        }
    }
    int ans=0;
    for(int i=0;i<2*n;i++){
        if(vis[i]) continue;
        {
            int cnt=0;
            for(auto v:ls[l[i]]){
                if(!vis[v]) cnt++;
            }
            if(cnt==1){
                int x=i;
                while(x!=-1){
                    vis[x]=true;
                    ans+=S[x];
                    int cnt2=0;
                    int nxt;
                    for(auto v:rs[r[x]]){
                        if(!vis[v]){
                            cnt2++;
                            nxt=v;
                        }
                    }
                    x=nxt;
                    vis[x]=true;
                    cnt2=0;
                    for(auto v:ls[l[x]]){
                        if(!vis[v]){
                            cnt2++;
                            nxt=v;
                        }
                    }
                    if(cnt2==1){
                        x=nxt;
                    }
                    else{
                        x=-1;
                    }
                }
            }
        }
        if(vis[i]) continue;
        {
            int cnt=0;
            for(auto v:rs[r[i]]){
                if(!vis[v]) cnt++;
            }
            if(cnt==1){
                int x=i;
                while(x!=-1){
                    vis[x]=true;
                    int cnt2=0;
                    int nxt;
                    for(auto v:ls[l[x]]){
                        if(!vis[v]){
                            cnt2++;
                            nxt=v;
                        }
                    }
                    x=nxt;
                    vis[x]=true;
                    ans+=S[x];
                    cnt2=0;
                    for(auto v:rs[r[x]]){
                        if(!vis[v]){
                            cnt2++;
                            nxt=v;
                        }
                    }
                    if(cnt2==1){
                        x=nxt;
                    }
                    else{
                        x=-1;
                    }
                }
            }
        }
    }
    vector<int> cand;
    for(int i=0;i<2*n;i++){
        if(vis[i]) continue;
        int x=i;
        int a=0;
        int b=0;
        int state=0;
        while(x!=-1){
            vis[x]=true;
            if(state==0){
                state=1;
                a+=S[x];
                bool tf=false;
                for(auto v:ls[l[x]]){
                    if(!vis[v]){
                        x=v;
                        tf=true;
                        break;
                    }
                }
                if(!tf) x=-1;
            }
            else{
                state=0;
                b+=S[x];
                bool tf=false;
                for(auto v:rs[r[x]]){
                    if(!vis[v]){
                        x=v;
                        tf=true;
                        break;
                    }
                }
                if(!tf) x=-1;
            }
        }
        ans+=a;
        cand.push_back(b-a);
    }
    bitset<mxn*20> b;
    b[ans]=1;
    for(auto v:cand){
        if(v>=0) b|=(b<<v);
        else b|=(b>>(-v));
    }
    int cur=all/2;
    while((all-cur)-cur<=k){
        if(b[cur] or b[all-cur]){
            cout<<"YES"<<'\n';
            return 0;
        }
        cur--;
    }
    cout<<"NO"<<'\n';
    return 0;
}
//maybe its multiset not set
//yeeorz
//laborz

Compilation message

tug.cpp: In function 'void setIO(std::string)':
tug.cpp:15:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tug.cpp:16:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tug.cpp: In function 'int main()':
tug.cpp:103:38: warning: 'nxt' may be used uninitialized in this function [-Wmaybe-uninitialized]
  103 |                     for(auto v:rs[r[x]]){
      |                                   ~~~^
tug.cpp:66:38: warning: 'nxt' may be used uninitialized in this function [-Wmaybe-uninitialized]
   66 |                     for(auto v:ls[l[x]]){
      |                                   ~~~^

Subtask #1
18.0 / 18.0

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

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 860 KB Output is correct
23 Correct 1 ms 856 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 856 KB Output is correct
26 Correct 82 ms 1224 KB Output is correct
27 Correct 9 ms 1116 KB Output is correct
28 Correct 58 ms 1116 KB Output is correct
29 Correct 16 ms 1460 KB Output is correct
30 Correct 83 ms 1212 KB Output is correct
31 Correct 10 ms 1116 KB Output is correct
32 Correct 74 ms 1116 KB Output is correct
33 Correct 12 ms 1116 KB Output is correct
34 Correct 6 ms 1116 KB Output is correct
35 Correct 9 ms 1232 KB Output is correct
36 Correct 58 ms 1116 KB Output is correct
37 Correct 10 ms 1112 KB Output is correct
38 Correct 80 ms 1372 KB Output is correct
39 Correct 9 ms 1116 KB Output is correct
40 Correct 59 ms 1116 KB Output is correct
41 Correct 11 ms 1112 KB Output is correct
42 Correct 58 ms 1112 KB Output is correct
43 Correct 10 ms 1240 KB Output is correct
44 Correct 58 ms 1116 KB Output is correct
45 Correct 13 ms 1112 KB Output is correct
46 Correct 58 ms 1116 KB Output is correct
47 Correct 1 ms 1116 KB Output is correct
48 Correct 14 ms 1116 KB Output is correct
49 Incorrect 14 ms 1116 KB Output isn't correct
50 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 220 ms 2360 KB Output is correct
2 Correct 5 ms 2392 KB Output is correct
3 Correct 198 ms 2136 KB Output is correct
4 Correct 6 ms 2140 KB Output is correct
5 Correct 205 ms 2140 KB Output is correct
6 Correct 6 ms 2140 KB Output is correct
7 Correct 222 ms 2360 KB Output is correct
8 Correct 6 ms 2140 KB Output is correct
9 Correct 215 ms 2140 KB Output is correct
10 Correct 5 ms 2136 KB Output is correct
11 Correct 197 ms 2140 KB Output is correct
12 Correct 5 ms 2136 KB Output is correct
13 Correct 219 ms 2360 KB Output is correct
14 Correct 249 ms 2368 KB Output is correct
15 Correct 6 ms 2136 KB Output is correct
16 Correct 212 ms 2140 KB Output is correct
17 Correct 5 ms 2140 KB Output is correct
18 Correct 203 ms 2140 KB Output is correct
19 Correct 5 ms 2140 KB Output is correct
20 Correct 206 ms 2380 KB Output is correct
21 Correct 6 ms 2140 KB Output is correct
22 Incorrect 47 ms 2140 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 860 KB Output is correct
23 Correct 1 ms 856 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 856 KB Output is correct
26 Correct 82 ms 1224 KB Output is correct
27 Correct 9 ms 1116 KB Output is correct
28 Correct 58 ms 1116 KB Output is correct
29 Correct 16 ms 1460 KB Output is correct
30 Correct 83 ms 1212 KB Output is correct
31 Correct 10 ms 1116 KB Output is correct
32 Correct 74 ms 1116 KB Output is correct
33 Correct 12 ms 1116 KB Output is correct
34 Correct 6 ms 1116 KB Output is correct
35 Correct 9 ms 1232 KB Output is correct
36 Correct 58 ms 1116 KB Output is correct
37 Correct 10 ms 1112 KB Output is correct
38 Correct 80 ms 1372 KB Output is correct
39 Correct 9 ms 1116 KB Output is correct
40 Correct 59 ms 1116 KB Output is correct
41 Correct 11 ms 1112 KB Output is correct
42 Correct 58 ms 1112 KB Output is correct
43 Correct 10 ms 1240 KB Output is correct
44 Correct 58 ms 1116 KB Output is correct
45 Correct 13 ms 1112 KB Output is correct
46 Correct 58 ms 1116 KB Output is correct
47 Correct 1 ms 1116 KB Output is correct
48 Correct 14 ms 1116 KB Output is correct
49 Incorrect 14 ms 1116 KB Output isn't correct
50 Halted 0 ms 0 KB -