oj.uz

Submission #45616

# Submission time Handle Problem Language Result Execution time Memory
45616 2018-04-15T16:27:34 Z eropsergeev Port Facility (JOI17_port_facility) C++17
100 / 100
 5391 ms 774840 KB 
#ifdef LOCKAL
    #define _GLIBCXX_DEBUG
#endif
#ifndef LOCKAL
    #pragma GCC optimize("Ofast")
    #pragma GCC target("sse,sse2,sse3,ssse3,sse4")
    #pragma GCC optimize("unroll-loops")
    #pragma GCC optimize("unroll-all-loops")
#endif
#include <bits/stdc++.h>
//#define TIMUS
//#define FILENAME "journey"
#ifndef TIMUS
    #include <ext/rope>
    #include <ext/pb_ds/assoc_container.hpp>
#endif // TIMUS
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define pb push_back
#define pii pair<int, int>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const int INF = INT_MAX / 2;
const ll LINF = (ll)2e18 + 666, M = 1e9 + 7;
const ld EPS = 1e-7;

#ifndef M_PI
    const ld M_PI = acos(-1);
#endif // M_PI

using namespace std;

#ifndef TIMUS
    using namespace __gnu_cxx;
    using namespace __gnu_pbds;

    template<class K, class T>
    using ordered_map = tree<K, T, less<K>, rb_tree_tag, tree_order_statistics_node_update>;

    template<class T>
    using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif

void run();

template<class T1, class T2>
inline bool mini(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}

template<class T1, class T2>
inline bool maxi(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}

int main()
{
    #ifndef LOCKAL
        #ifdef FILENAME
            freopen(FILENAME".in", "r", stdin);
            freopen(FILENAME".out", "w", stdout);
        #endif // FILENAME
    #endif
    #ifndef TIMUS
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    #endif // TIMUS
    srand(time(0));
    auto start = clock();
    run();
    #ifdef LOCKAL
        //cout << endl;
        cout << "\ntime = " << (ld)(clock() - start) / CLOCKS_PER_SEC << "\n";
    #endif
    return 0;
}

//#define DEBUG
#if defined DEBUG && defined LOCKAL
    #define debugdo(x) x
#else
    #define debugdo(x)
#endif

#define debug_for(x) debug(#x": "); debugdo(for (auto &_x: x)) debug2(_x); debug("")
#define debug(x) debugdo(cout << x << endl)
#define debug2(x) debugdo(cout << x << " ")

// ---SOLUTION--- //

#define FAST 1e9
#ifdef FAST
    char buf[(int)FAST];
    size_t p = 0;
    inline void *operator new(size_t n)
    {
        p += n;
        return buf + p - n;
    }
    inline void operator delete(void *){}
#endif

struct min_f
{
    static int neutral;
    int operator()(int a, int b)
    {
        return min(a, b);
    }
};


struct max_f
{
    static int neutral;
    int operator()(int a, int b)
    {
        return max(a, b);
    }
};

int max_f::neutral;
int min_f::neutral;

template<class T, class F>
struct segtree
{
    F f;
    int n;
    vector<T> a;
    segtree(int n = 0): n(n), a(n * 4, F::neutral){}
    void set(int p, T x, int v = 0, int l = 0, int r = -1)
    {
        if (r == -1)
            r = n;
        if (p < l || p >= r)
            return;
        if (r - l == 1)
        {
            a[v] = x;
            return;
        }
        int c = (r + l) / 2;
        set(p, x, v * 2 + 1, l, c);
        set(p, x, v * 2 + 2, c, r);
        a[v] = f(a[v * 2 + 1], a[v * 2 + 2]);
    }
    T get(int ql, int qr, int v = 0, int l = 0, int r = -1)
    {
        if (r == -1)
            r = n;
        if (ql >= r || l >= qr)
            return F::neutral;
        if (ql <= l && r <= qr)
            return a[v];
        int c = (r + l) / 2;
        return f(get(ql, qr, v * 2 + 1, l, c), get(ql, qr, v * 2 + 2, c, r)); 
    }
};

void run()
{
    max_f::neutral = -INF;
    min_f::neutral = INF;
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    segtree<int, max_f> e(n * 2);
    segtree<int, min_f> s(n * 2);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i] >> b[i];
        a[i]--;
        b[i]--;
        e.set(a[i], b[i]);
        s.set(b[i], a[i]);
    }
    vector<int> ev(n * 2);
    for (int i = 0; i < n; i++)
    {
        ev[a[i]] = i + 1;
        ev[b[i]] = -i - 1;
    }
    vector<char> use(n);
    ll ans = 1;
    for (int i = 0; i < n; i++)
    {
        if (!use[i])
        {
            ans = ans * 2 % M;
            queue<int> q;
            q.push(i);
            while (!q.empty())
            {
                int v = q.front();
                q.pop();
                if (!use[v])
                    use[v] = 1;
                debug("v = " << v);
                debug(s.get(6, 7).F);
                e.set(a[v], max_f::neutral);
                s.set(b[v], min_f::neutral);
                while (1)
                {
                    bool f = 0;
                    auto x = e.get(a[v] + 1, b[v]);
                    if (x > b[v])
                    {
                        q.push(-ev[x] - 1);
                        use[-ev[x] - 1] = use[v] ^ 3;
                        debug(v << " - " << x.S);
                        e.set(a[-ev[x] - 1], max_f::neutral);
                        s.set(b[-ev[x] - 1], min_f::neutral);
                        f = 1;
                    }
                    x = s.get(a[v] + 1, b[v]);
                    if (x < a[v])
                    {
                        q.push(ev[x] - 1);
                        use[ev[x] - 1] = use[v] ^ 3;
                        debug(v << " - " << x.S);
                        e.set(a[ev[x] - 1], max_f::neutral);
                        s.set(b[ev[x] - 1], min_f::neutral);
                        f = 1;
                    }
                    if (!f)
                        break;
                }
            }
        }
    }
    #define c use
    for (auto &x: use)
        x--;
    debug_for(use);
    {
        stack<int> a, b;
        for (auto x: ev)
        {
            if (x > 0)
            {
                if (c[x - 1])
                    a.push(x);
                else
                    b.push(x);
            }
            else
            {
                x = -x;
                if (c[x - 1])
                {
                    if (a.top() != x)
                    {
                        cout << 0;
                        return;
                    }
                    a.pop();
                }
                else
                {
                    if (b.top() != x)
                    {
                        cout << 0;
                        return;
                    }
                    b.pop();
                }
            }
        }
        cout << ans;
    }
}
/*
43132142
*/

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:86:10: warning: unused variable 'start' [-Wunused-variable]
     auto start = clock();
          ^~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 608 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 2 ms 716 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 2 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 716 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 608 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 2 ms 716 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 2 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 6 ms 1024 KB Output is correct
26 Correct 6 ms 1024 KB Output is correct
27 Correct 6 ms 1024 KB Output is correct
28 Correct 6 ms 1024 KB Output is correct
29 Correct 6 ms 1024 KB Output is correct
30 Correct 6 ms 1024 KB Output is correct
31 Correct 7 ms 1084 KB Output is correct
32 Correct 7 ms 1084 KB Output is correct
33 Correct 6 ms 1100 KB Output is correct
34 Correct 6 ms 1100 KB Output is correct
35 Correct 8 ms 1916 KB Output is correct
36 Correct 6 ms 2020 KB Output is correct
37 Correct 6 ms 2020 KB Output is correct
38 Correct 6 ms 2020 KB Output is correct
39 Correct 8 ms 2020 KB Output is correct
40 Correct 5 ms 2020 KB Output is correct
41 Correct 7 ms 2020 KB Output is correct
42 Correct 6 ms 2020 KB Output is correct
43 Correct 5 ms 2020 KB Output is correct
44 Correct 5 ms 2020 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 608 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 2 ms 716 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 2 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 6 ms 1024 KB Output is correct
26 Correct 6 ms 1024 KB Output is correct
27 Correct 6 ms 1024 KB Output is correct
28 Correct 6 ms 1024 KB Output is correct
29 Correct 6 ms 1024 KB Output is correct
30 Correct 6 ms 1024 KB Output is correct
31 Correct 7 ms 1084 KB Output is correct
32 Correct 7 ms 1084 KB Output is correct
33 Correct 6 ms 1100 KB Output is correct
34 Correct 6 ms 1100 KB Output is correct
35 Correct 8 ms 1916 KB Output is correct
36 Correct 6 ms 2020 KB Output is correct
37 Correct 6 ms 2020 KB Output is correct
38 Correct 6 ms 2020 KB Output is correct
39 Correct 8 ms 2020 KB Output is correct
40 Correct 5 ms 2020 KB Output is correct
41 Correct 7 ms 2020 KB Output is correct
42 Correct 6 ms 2020 KB Output is correct
43 Correct 5 ms 2020 KB Output is correct
44 Correct 5 ms 2020 KB Output is correct
45 Correct 332 ms 21152 KB Output is correct
46 Correct 377 ms 21160 KB Output is correct
47 Correct 336 ms 21320 KB Output is correct
48 Correct 354 ms 21320 KB Output is correct
49 Correct 332 ms 21320 KB Output is correct
50 Correct 346 ms 21320 KB Output is correct
51 Correct 323 ms 21320 KB Output is correct
52 Correct 279 ms 64892 KB Output is correct
53 Correct 318 ms 65408 KB Output is correct
54 Correct 365 ms 65408 KB Output is correct
55 Correct 317 ms 65408 KB Output is correct
56 Correct 328 ms 65408 KB Output is correct
57 Correct 314 ms 65408 KB Output is correct
58 Correct 265 ms 65408 KB Output is correct
59 Correct 307 ms 65408 KB Output is correct
60 Correct 339 ms 65408 KB Output is correct
61 Correct 356 ms 65408 KB Output is correct
62 Correct 302 ms 65408 KB Output is correct
63 Correct 326 ms 65408 KB Output is correct
64 Correct 328 ms 65408 KB Output is correct
65 Correct 407 ms 65408 KB Output is correct
66 Correct 408 ms 65408 KB Output is correct
67 Correct 371 ms 65408 KB Output is correct
68 Correct 371 ms 65408 KB Output is correct
69 Correct 362 ms 65408 KB Output is correct
70 Correct 438 ms 65408 KB Output is correct
71 Correct 360 ms 65408 KB Output is correct
72 Correct 355 ms 65408 KB Output is correct
73 Correct 354 ms 65408 KB Output is correct
74 Correct 342 ms 65408 KB Output is correct
75 Correct 302 ms 65408 KB Output is correct
76 Correct 311 ms 65408 KB Output is correct
77 Correct 321 ms 65408 KB Output is correct
78 Correct 341 ms 65408 KB Output is correct
79 Correct 323 ms 65408 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 608 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 2 ms 716 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 2 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 6 ms 1024 KB Output is correct
26 Correct 6 ms 1024 KB Output is correct
27 Correct 6 ms 1024 KB Output is correct
28 Correct 6 ms 1024 KB Output is correct
29 Correct 6 ms 1024 KB Output is correct
30 Correct 6 ms 1024 KB Output is correct
31 Correct 7 ms 1084 KB Output is correct
32 Correct 7 ms 1084 KB Output is correct
33 Correct 6 ms 1100 KB Output is correct
34 Correct 6 ms 1100 KB Output is correct
35 Correct 8 ms 1916 KB Output is correct
36 Correct 6 ms 2020 KB Output is correct
37 Correct 6 ms 2020 KB Output is correct
38 Correct 6 ms 2020 KB Output is correct
39 Correct 8 ms 2020 KB Output is correct
40 Correct 5 ms 2020 KB Output is correct
41 Correct 7 ms 2020 KB Output is correct
42 Correct 6 ms 2020 KB Output is correct
43 Correct 5 ms 2020 KB Output is correct
44 Correct 5 ms 2020 KB Output is correct
45 Correct 332 ms 21152 KB Output is correct
46 Correct 377 ms 21160 KB Output is correct
47 Correct 336 ms 21320 KB Output is correct
48 Correct 354 ms 21320 KB Output is correct
49 Correct 332 ms 21320 KB Output is correct
50 Correct 346 ms 21320 KB Output is correct
51 Correct 323 ms 21320 KB Output is correct
52 Correct 279 ms 64892 KB Output is correct
53 Correct 318 ms 65408 KB Output is correct
54 Correct 365 ms 65408 KB Output is correct
55 Correct 317 ms 65408 KB Output is correct
56 Correct 328 ms 65408 KB Output is correct
57 Correct 314 ms 65408 KB Output is correct
58 Correct 265 ms 65408 KB Output is correct
59 Correct 307 ms 65408 KB Output is correct
60 Correct 339 ms 65408 KB Output is correct
61 Correct 356 ms 65408 KB Output is correct
62 Correct 302 ms 65408 KB Output is correct
63 Correct 326 ms 65408 KB Output is correct
64 Correct 328 ms 65408 KB Output is correct
65 Correct 407 ms 65408 KB Output is correct
66 Correct 408 ms 65408 KB Output is correct
67 Correct 371 ms 65408 KB Output is correct
68 Correct 371 ms 65408 KB Output is correct
69 Correct 362 ms 65408 KB Output is correct
70 Correct 438 ms 65408 KB Output is correct
71 Correct 360 ms 65408 KB Output is correct
72 Correct 355 ms 65408 KB Output is correct
73 Correct 354 ms 65408 KB Output is correct
74 Correct 342 ms 65408 KB Output is correct
75 Correct 302 ms 65408 KB Output is correct
76 Correct 311 ms 65408 KB Output is correct
77 Correct 321 ms 65408 KB Output is correct
78 Correct 341 ms 65408 KB Output is correct
79 Correct 323 ms 65408 KB Output is correct
80 Correct 4269 ms 205636 KB Output is correct
81 Correct 4616 ms 206440 KB Output is correct
82 Correct 4627 ms 206844 KB Output is correct
83 Correct 4672 ms 206844 KB Output is correct
84 Correct 4400 ms 206844 KB Output is correct
85 Correct 4371 ms 219176 KB Output is correct
86 Correct 4352 ms 233556 KB Output is correct
87 Correct 3505 ms 687176 KB Output is correct
88 Correct 4488 ms 705856 KB Output is correct
89 Correct 4229 ms 705856 KB Output is correct
90 Correct 4602 ms 705856 KB Output is correct
91 Correct 4336 ms 705856 KB Output is correct
92 Correct 4054 ms 705856 KB Output is correct
93 Correct 3756 ms 774840 KB Output is correct
94 Correct 4464 ms 774840 KB Output is correct
95 Correct 4735 ms 774840 KB Output is correct
96 Correct 4391 ms 774840 KB Output is correct
97 Correct 4291 ms 774840 KB Output is correct
98 Correct 4552 ms 774840 KB Output is correct
99 Correct 4460 ms 774840 KB Output is correct
100 Correct 5391 ms 774840 KB Output is correct
101 Correct 5321 ms 774840 KB Output is correct
102 Correct 4613 ms 774840 KB Output is correct
103 Correct 4762 ms 774840 KB Output is correct
104 Correct 4677 ms 774840 KB Output is correct
105 Correct 4847 ms 774840 KB Output is correct
106 Correct 4431 ms 774840 KB Output is correct
107 Correct 4839 ms 774840 KB Output is correct
108 Correct 4647 ms 774840 KB Output is correct
109 Correct 4547 ms 774840 KB Output is correct
110 Correct 3613 ms 774840 KB Output is correct
111 Correct 3743 ms 774840 KB Output is correct
112 Correct 3767 ms 774840 KB Output is correct
113 Correct 4328 ms 774840 KB Output is correct
114 Correct 4548 ms 774840 KB Output is correct