oj.uz

Submission #251011

# Submission time Handle Problem Language Result Execution time Memory
251011 2020-07-19T22:48:44 Z ant101 Toy Train (IOI17_train) C++14
100 / 100
 866 ms 1564 KB 
#include "train.h"
#include <iostream>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <vector>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <assert.h>
#include <limits>
#include <cstdio>
#include <complex>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
#define mp make_pair
#define f first
#define s second

typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353; // = (119<<23)+1
const int MX = 2e5+5;
const ll INF = 1e18;
const ld PI = 4*atan((ld)1);
const int dx[4] = {0,1,0,-1}, dy[4] = {1,0,-1,0};


namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        // cin.exceptions(cin.failbit); // ex. throws exception when you try to read letter into int
        if (sz(s)) {
            setIn(s+".in");
            setOut(s+".out");
        } // for USACO
    }
}

using namespace io;

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
    
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
        re(first); re(rest...);
    }
    
    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);
    
    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        pr(first); pr(rest...);
    }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr("{",x.f,", ",x.s,"}");
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) {
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

using namespace input;

ll add(ll a, ll b) {
    a += b;
    if(a >= MOD) {
        a -= MOD;
    }
    return a;
}
ll sub(ll a, ll b) {
    a -= b;
    if(a < 0) {
        a += MOD;
    }
    return a;
}

ll mul(ll a, ll b) {
    return (a * b)%MOD;
}

void add_self(ll& a, ll b) {
    a = add(a, b);
}
void sub_self(ll& a, ll b) {
    a = sub(a, b);
}
void mul_self(ll& a, ll b) {
    a = mul(a, b);
}

int n, m;
vector<int> gph[5005];
vector<int> proc;

vector<int> always(vector<int> &a, vector<int> &v, int winner){
    vector<int> deg(n);
    queue<int> que;
    F0R (i, n) {
        if (proc[i]) {
            continue;
        }
        trav(j, gph[i]) {
            if(!proc[j]) deg[j]++;
        }
    }
    trav(i, v) {
        if (deg[i] > 0) {
            deg[i] = 0;
        }
        que.push(i);
    }
    vector<int> ret;
    while (!que.empty()) {
        int x = que.front();
        que.pop();
        ret.push_back(x);
        trav(i, gph[x]) {
            if (proc[i]) {
                continue;
            }
            if (a[i] == winner && deg[i] > 0) {
                deg[i] = 0;
                que.push(i);
            }
            else if (a[i] != winner) {
                deg[i]--;
                if (deg[i] == 0) {
                    que.push(i);
                }
            }
        }
    }
    return ret;
}

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v){
    n = a.size();
    m = u.size();
    vector<int> ret(n);
    proc.resize(n);
    F0R (i, m) {
        gph[v[i]].push_back(u[i]);
    }
    while(true) {
        int unproc = count(proc.begin(), proc.end(), 0);
        if (unproc == 0) {
            break;
        }
        vector<int> R;
        F0R (i, n) {
            if (!proc[i] && r[i]) {
                R.push_back(i);
            }
        }
        R = always(a, R, 1);
        if (R.size() == unproc) {
            trav(i, R) {
                proc[i] = 1;
                ret[i] = 1;
            }
        } else {
            vector<int> rem(n);
            trav(i, R) {
                rem[i] = 1;
            }
            R.clear();
            F0R (i, n) {
                if (!proc[i] && !rem[i]) {
                    R.push_back(i);
                }
            }
            R = always(a, R, 0);
            trav(i, R) {
                proc[i] = 1, ret[i] = 0;
            }
        }
    }
    return ret;
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:233:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (R.size() == unproc) {
             ~~~~~~~~~^~~~~~~~~
train.cpp: In function 'void io::setIn(std::__cxx11::string)':
train.cpp:68:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
train.cpp: In function 'void io::setOut(std::__cxx11::string)':
train.cpp:69:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1024 KB Output is correct
2 Correct 7 ms 1024 KB Output is correct
3 Correct 6 ms 1024 KB Output is correct
4 Correct 6 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 6 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 6 ms 1024 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 5 ms 1024 KB Output is correct
11 Correct 5 ms 1024 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 1432 KB Output is correct
2 Correct 375 ms 1408 KB Output is correct
3 Correct 499 ms 1440 KB Output is correct
4 Correct 10 ms 1408 KB Output is correct
5 Correct 13 ms 1408 KB Output is correct
6 Correct 12 ms 1408 KB Output is correct
7 Correct 9 ms 1408 KB Output is correct
8 Correct 9 ms 1408 KB Output is correct
9 Correct 8 ms 1408 KB Output is correct
10 Correct 9 ms 1280 KB Output is correct
11 Correct 8 ms 1368 KB Output is correct
12 Correct 8 ms 1388 KB Output is correct
13 Correct 9 ms 1408 KB Output is correct
14 Correct 8 ms 1408 KB Output is correct
15 Correct 8 ms 1408 KB Output is correct
16 Correct 9 ms 1536 KB Output is correct
17 Correct 9 ms 1408 KB Output is correct
18 Correct 553 ms 1272 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1272 KB Output is correct
2 Correct 8 ms 1280 KB Output is correct
3 Correct 10 ms 1408 KB Output is correct
4 Correct 13 ms 1408 KB Output is correct
5 Correct 10 ms 1408 KB Output is correct
6 Correct 9 ms 1408 KB Output is correct
7 Correct 9 ms 1408 KB Output is correct
8 Correct 8 ms 1408 KB Output is correct
9 Correct 9 ms 1280 KB Output is correct
10 Correct 8 ms 1408 KB Output is correct
11 Correct 11 ms 1408 KB Output is correct
12 Correct 9 ms 1408 KB Output is correct
13 Correct 9 ms 1408 KB Output is correct
14 Correct 9 ms 1280 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1408 KB Output is correct
2 Correct 11 ms 1408 KB Output is correct
3 Correct 10 ms 1408 KB Output is correct
4 Correct 9 ms 1280 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 6 ms 1024 KB Output is correct
8 Correct 6 ms 1024 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 6 ms 896 KB Output is correct

Subtask #6
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1024 KB Output is correct
2 Correct 7 ms 1024 KB Output is correct
3 Correct 6 ms 1024 KB Output is correct
4 Correct 6 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 6 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 6 ms 1024 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 5 ms 1024 KB Output is correct
11 Correct 5 ms 1024 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 209 ms 1432 KB Output is correct
33 Correct 375 ms 1408 KB Output is correct
34 Correct 499 ms 1440 KB Output is correct
35 Correct 10 ms 1408 KB Output is correct
36 Correct 13 ms 1408 KB Output is correct
37 Correct 12 ms 1408 KB Output is correct
38 Correct 9 ms 1408 KB Output is correct
39 Correct 9 ms 1408 KB Output is correct
40 Correct 8 ms 1408 KB Output is correct
41 Correct 9 ms 1280 KB Output is correct
42 Correct 8 ms 1368 KB Output is correct
43 Correct 8 ms 1388 KB Output is correct
44 Correct 9 ms 1408 KB Output is correct
45 Correct 8 ms 1408 KB Output is correct
46 Correct 8 ms 1408 KB Output is correct
47 Correct 9 ms 1536 KB Output is correct
48 Correct 9 ms 1408 KB Output is correct
49 Correct 553 ms 1272 KB Output is correct
50 Correct 7 ms 1272 KB Output is correct
51 Correct 8 ms 1280 KB Output is correct
52 Correct 10 ms 1408 KB Output is correct
53 Correct 13 ms 1408 KB Output is correct
54 Correct 10 ms 1408 KB Output is correct
55 Correct 9 ms 1408 KB Output is correct
56 Correct 9 ms 1408 KB Output is correct
57 Correct 8 ms 1408 KB Output is correct
58 Correct 9 ms 1280 KB Output is correct
59 Correct 8 ms 1408 KB Output is correct
60 Correct 11 ms 1408 KB Output is correct
61 Correct 9 ms 1408 KB Output is correct
62 Correct 9 ms 1408 KB Output is correct
63 Correct 9 ms 1280 KB Output is correct
64 Correct 9 ms 1408 KB Output is correct
65 Correct 11 ms 1408 KB Output is correct
66 Correct 10 ms 1408 KB Output is correct
67 Correct 9 ms 1280 KB Output is correct
68 Correct 1 ms 512 KB Output is correct
69 Correct 5 ms 1024 KB Output is correct
70 Correct 6 ms 1024 KB Output is correct
71 Correct 6 ms 1024 KB Output is correct
72 Correct 7 ms 1152 KB Output is correct
73 Correct 2 ms 640 KB Output is correct
74 Correct 6 ms 896 KB Output is correct
75 Correct 330 ms 1400 KB Output is correct
76 Correct 428 ms 1408 KB Output is correct
77 Correct 569 ms 1532 KB Output is correct
78 Correct 573 ms 1564 KB Output is correct
79 Correct 572 ms 1408 KB Output is correct
80 Correct 9 ms 1408 KB Output is correct
81 Correct 9 ms 1408 KB Output is correct
82 Correct 10 ms 1408 KB Output is correct
83 Correct 10 ms 1408 KB Output is correct
84 Correct 13 ms 1408 KB Output is correct
85 Correct 11 ms 1408 KB Output is correct
86 Correct 11 ms 1408 KB Output is correct
87 Correct 9 ms 1408 KB Output is correct
88 Correct 14 ms 1408 KB Output is correct
89 Correct 10 ms 1408 KB Output is correct
90 Correct 20 ms 1408 KB Output is correct
91 Correct 18 ms 1408 KB Output is correct
92 Correct 32 ms 1432 KB Output is correct
93 Correct 37 ms 1400 KB Output is correct
94 Correct 35 ms 1408 KB Output is correct
95 Correct 36 ms 1408 KB Output is correct
96 Correct 123 ms 1324 KB Output is correct
97 Correct 478 ms 1408 KB Output is correct
98 Correct 808 ms 1528 KB Output is correct
99 Correct 866 ms 1528 KB Output is correct
100 Correct 559 ms 1144 KB Output is correct