oj.uz

답안 #1022914

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1022914 2024-07-14T07:33:20 Z yeediot Tug of War (BOI15_tug) C++17
71 / 100
 94 ms 5020 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void CHECK();
void setio(){
    freopen("/Users/iantsai/cpp/input.txt","r",stdin);
    freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn = 3e4 + 5;
int n, k, sum = 0, cur = 0;
multiset<pii>adj[mxn];
bool vis[mxn];
void solve(){
    cin >> n >> k;
    for(int i = 1; i <= 2 * n; i++){
        int l, r, s;
        cin >> l >> r >> s;
        r += n;
        adj[l].insert({r, s});
        adj[r].insert({l, -s});
    }
    queue<int>q;
    for(int i = 1; i <= 2 * n; i++){
        if(sz(adj[i]) == 0){
            cout << "NO\n";
            return;
        }
        else if(sz(adj[i]) == 1){
            q.push(i);
        }
    }
    while(sz(q)){
        auto v = q.front();
        q.pop();
        vis[v] = 1;
        auto [u, c] = *adj[v].begin();
        cur += c;
        adj[u].erase(adj[u].find({v, -c}));
        adj[v].clear();
        if(sz(adj[u]) == 1) q.push(u);
    }
    vector<int>val;
    val.pb(abs(cur));
    bitset<mxn * 20>bs;
    for(int i = 1; i <= 2 * n; i++){
        if(vis[i]) continue;
        cur = 0;
        int v = i;
        adj[i].erase(adj[i].begin());
        vis[v] = 1;
        do{
            auto [u, c] = *adj[v].begin();
            vis[u] = 1;
            adj[v].erase(adj[v].begin());
            cur += c;
            debug(cur);
            if(u != i)adj[u].erase(adj[u].find({v, -c}));
            v = u;
        }while(v != i);
        val.pb(abs(cur));
    }
    bs[0] = 1;
    debug(val);
    for(auto x : val){
        bs |= bs << x;
        sum += x;
    }
    for(int i = 0; i <= sum; i++){
        //debug(i, (bool)bs[i]);
        if(bs[i] and abs(sum - 2 * i) <= k){
            cout << "YES\n";
            return;
        }
    }
    cout <<"NO\n";
    return ;
}
signed main(){
    TOI_is_so_de;
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    #ifdef local
    CHECK();
    #endif
}
/*
input:
 
*/
#ifdef local
void CHECK(){
    cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
    function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
        std::ifstream file1(p1);
        std::ifstream file2(p2);
        if(!file1.is_open() || !file2.is_open()) return false;
        std::string line1, line2;
        while (getline(file1, line1) && getline(file2, line2)) {
            if (line1 != line2)return false;
        }
        int cnta = 0, cntb = 0;
        while(getline(file1,line1))cnta++;
        while(getline(file2,line2))cntb++;
        return cntb - cnta <= 1;
    };
    bool check = compareFiles("output.txt","expected.txt");
    if(check) cerr<<"ACCEPTED\n";
    else cerr<<"WRONG ANSWER!\n";
}
#else
#endif

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 2 ms 1880 KB Output is correct
8 Correct 2 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 1844 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 1 ms 1884 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 1 ms 1884 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 1 ms 1884 KB Output is correct
24 Correct 1 ms 1884 KB Output is correct
25 Correct 1 ms 1884 KB Output is correct
26 Correct 29 ms 2680 KB Output is correct
27 Correct 6 ms 2444 KB Output is correct
28 Correct 29 ms 2652 KB Output is correct
29 Correct 6 ms 2392 KB Output is correct
30 Correct 28 ms 2576 KB Output is correct
31 Correct 6 ms 2392 KB Output is correct
32 Correct 28 ms 2652 KB Output is correct
33 Correct 6 ms 2596 KB Output is correct
34 Correct 5 ms 2396 KB Output is correct
35 Correct 7 ms 2392 KB Output is correct
36 Correct 31 ms 2652 KB Output is correct
37 Correct 6 ms 2396 KB Output is correct
38 Correct 29 ms 2652 KB Output is correct
39 Correct 6 ms 2396 KB Output is correct
40 Correct 29 ms 2668 KB Output is correct
41 Correct 6 ms 2396 KB Output is correct
42 Correct 30 ms 2676 KB Output is correct
43 Correct 6 ms 2396 KB Output is correct
44 Correct 28 ms 2652 KB Output is correct
45 Correct 7 ms 2616 KB Output is correct
46 Correct 28 ms 2652 KB Output is correct
47 Correct 2 ms 2396 KB Output is correct
48 Correct 15 ms 2560 KB Output is correct
49 Correct 16 ms 2652 KB Output is correct
50 Correct 29 ms 2652 KB Output is correct
51 Correct 30 ms 2652 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 4956 KB Output is correct
2 Correct 7 ms 4696 KB Output is correct
3 Correct 81 ms 4952 KB Output is correct
4 Correct 9 ms 4700 KB Output is correct
5 Correct 79 ms 5016 KB Output is correct
6 Correct 9 ms 4696 KB Output is correct
7 Correct 80 ms 4956 KB Output is correct
8 Correct 11 ms 4696 KB Output is correct
9 Correct 79 ms 4956 KB Output is correct
10 Correct 7 ms 4696 KB Output is correct
11 Correct 80 ms 5020 KB Output is correct
12 Correct 11 ms 4696 KB Output is correct
13 Correct 79 ms 4916 KB Output is correct
14 Correct 80 ms 4952 KB Output is correct
15 Correct 9 ms 4700 KB Output is correct
16 Correct 78 ms 4956 KB Output is correct
17 Correct 8 ms 4700 KB Output is correct
18 Correct 79 ms 4856 KB Output is correct
19 Correct 8 ms 4696 KB Output is correct
20 Correct 94 ms 5016 KB Output is correct
21 Correct 9 ms 4696 KB Output is correct
22 Correct 47 ms 4956 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 2 ms 1880 KB Output is correct
8 Correct 2 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 1844 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 1 ms 1884 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 1 ms 1884 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 1 ms 1884 KB Output is correct
24 Correct 1 ms 1884 KB Output is correct
25 Correct 1 ms 1884 KB Output is correct
26 Correct 29 ms 2680 KB Output is correct
27 Correct 6 ms 2444 KB Output is correct
28 Correct 29 ms 2652 KB Output is correct
29 Correct 6 ms 2392 KB Output is correct
30 Correct 28 ms 2576 KB Output is correct
31 Correct 6 ms 2392 KB Output is correct
32 Correct 28 ms 2652 KB Output is correct
33 Correct 6 ms 2596 KB Output is correct
34 Correct 5 ms 2396 KB Output is correct
35 Correct 7 ms 2392 KB Output is correct
36 Correct 31 ms 2652 KB Output is correct
37 Correct 6 ms 2396 KB Output is correct
38 Correct 29 ms 2652 KB Output is correct
39 Correct 6 ms 2396 KB Output is correct
40 Correct 29 ms 2668 KB Output is correct
41 Correct 6 ms 2396 KB Output is correct
42 Correct 30 ms 2676 KB Output is correct
43 Correct 6 ms 2396 KB Output is correct
44 Correct 28 ms 2652 KB Output is correct
45 Correct 7 ms 2616 KB Output is correct
46 Correct 28 ms 2652 KB Output is correct
47 Correct 2 ms 2396 KB Output is correct
48 Correct 15 ms 2560 KB Output is correct
49 Correct 16 ms 2652 KB Output is correct
50 Correct 29 ms 2652 KB Output is correct
51 Correct 30 ms 2652 KB Output is correct
52 Correct 78 ms 4956 KB Output is correct
53 Correct 7 ms 4696 KB Output is correct
54 Correct 81 ms 4952 KB Output is correct
55 Correct 9 ms 4700 KB Output is correct
56 Correct 79 ms 5016 KB Output is correct
57 Correct 9 ms 4696 KB Output is correct
58 Correct 80 ms 4956 KB Output is correct
59 Correct 11 ms 4696 KB Output is correct
60 Correct 79 ms 4956 KB Output is correct
61 Correct 7 ms 4696 KB Output is correct
62 Correct 80 ms 5020 KB Output is correct
63 Correct 11 ms 4696 KB Output is correct
64 Correct 79 ms 4916 KB Output is correct
65 Correct 80 ms 4952 KB Output is correct
66 Correct 9 ms 4700 KB Output is correct
67 Correct 78 ms 4956 KB Output is correct
68 Correct 8 ms 4700 KB Output is correct
69 Correct 79 ms 4856 KB Output is correct
70 Correct 8 ms 4696 KB Output is correct
71 Correct 94 ms 5016 KB Output is correct
72 Correct 9 ms 4696 KB Output is correct
73 Correct 47 ms 4956 KB Output is correct
74 Runtime error 2 ms 3676 KB Execution killed with signal 11
75 Halted 0 ms 0 KB -