Submission #40852

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
40852	2018-02-09T12:49:14 Z	grumpy_gordon	Port Facility (JOI17_port_facility)	C++14	100 / 100	1571 ms	119396 KB

port_facility

/*
                     .:*+=%@@@@@@=-.
                 .:=@#@@@#@@#######%==*.
              .-=####@######%*-.....:%##%.
            .*@###########%+:--........-%@-
          .*@##############@+--.........-:%-
        .+##################@==%%%%=+*:----+.
      .-@####################%++%@@@@@=+**%@@*
      .%###################@%%@@@###@%+:--%@@%.
     -@###################@%%%%*::*%++:-----=@+.
    -#####################@%=++++++*:-------.-=:
   .+####################@%++*::-:::--::*:::***=:
   .@#####################%=++*::::-:::++*=##@@#@-
  ..#####################@%%=++**:::::**+%@#@%%##-..
   .%####################@@%=+++*+****::*=@######@.
  .=######################@%%==+==++**+=@%@##@###+:...
  -#######################@@@%%%===++=@@@%=++===*::--...
  -########################@@@@@@@%==%%=++==@@:::::*:--.
..:#########################@@@@@@%%======++++::-..:-.--...
%#############################@###@%%@@%==%=%*----.--.::---.
#############################################*-:*:-:---*---- .
#############################################*--*--:---*---:-.
#############################################+--::--::-*::-::.
###########################################+:*-.---.---.:---*-..
###########################################**:-----------------.
##########################################@::**:--::::::--:::::-
###########################################:--:*:::::::::**::*+*
###########################################=:::***::::::**:::*+*
############################@@@@@@#########@+****::::********+++
############################@%%%%%@@@@@@@###%+***::::::::***+==+
############################@%%%%%%%%%%%@####=+:::-::::-::*+=%%+
#############################@%%%%%%%%%%@#####=::--------:*=%@%+
%###########################@%%%%==%%%%%%@##@#=:------..-:+%@@%=
----------------------------------------------
--------------------------------------------
----------------------------------------------
--------------------------------------------
----------------------------------------------

         o###########oo
      o##"          ""##o
    o#"                "##
  o#"                    "#o
 #"  ##              ##   "##
#"                          ##
#  ###################       #
#                            #
#                            #
#                            #
#                            #
#                            #
#                            #
#o                           #
"#o                         ##
 "#o                       ##
  "#o                    o#"
   "#o                  ##
     "#o              o#"
       "#ooo      ooo#######oo
        ###############   "######o
     o###""        "###o      # ###
   o###o     oooo    ###    oo####"
 o###**#     #**#   ############"
 ""##""""""""""###########    #
    # oooooooo#"#**     ##    #
    # #       # # **    ##    #
    #o#       #o#  *****###ooo#
                        ##
                        ##   o###o
                        ## o##***##
               o########## #***#**##o
             o##"   ""###  #***##***#
 o#######o  ###   oo####   ##**####*#
o##"  ""#############""     ##****###
##"         ##              ##*##*###
##          ###              ##### ##
##           ###              # ##  #
##            ##                 #
##             ##
##             ###
##              ###oo
###              ""###
 ###
  ###
*/
#include <bits/stdc++.h>

//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#pragma GCC target("avx,tune=native")
//float __attribute__((aligned(32)))

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

typedef long double ld;

int mysqrt(ll x){
    int l = 0, r = 1e9 + 1;
    while (r - l > 1){
        int m = (l + r) / 2;
        if (m * (ll)m <= x)
            l = m;
        else
            r = m;
    }
    return l;
}

mt19937 rnd(1337);

ll AR = 19, BR = 13, CR = 23, XR = 228, YR = 322, MODR = 1e9 + 993;

ll myrand(){
    ll ZR = (XR * AR + YR * BR + CR) % MODR;
    XR = YR;
    YR = ZR;
    return ZR;
}

const int Mod = 1e9 + 7;

int bpow(int x, int y){
    if (y == 0)
        return 1;
    if (y == 1)
        return x;
    int ret = bpow(x, y >> 1);
    ret = (ret * (ll)ret) % Mod;
    if (y & 1)
        ret = (ret * (ll)x) % Mod;
    return ret;
}

int bdiv(int x, int y){
    return (x * (ll)bpow(y, Mod - 2)) % Mod;
}

void setmin(int &x, int y){
    x = min(x, y);
}

void setmax(int &x, int y){
    x = max(x, y);
}

void setmin(ll &x, ll y){
    x = min(x, y);
}

void setmax(ll &x, ll y){
    x = max(x, y);
}

int gcd(int a, int b){
    return a ? gcd(b % a, a) : b;
}

const ll llinf = 2e18 + 100;

const int maxn = 2e5 + 100, maxw = 1e6 + 100, inf = 2e9 + 100, sq = 300, mod = 1e9 + 7, LG = 17;

pair<int, int> a[maxw];

int arr[2 * maxw];

int n;

vector<pair<int, int> > w;

int p[maxw];

int r[maxw];

int get(int x){
    return x == p[x] ? x : p[x] = get(p[x]);
}

void uni(int x, int y){
    x = get(x);
    y = get(y);
    if (x == y)
        return;
    if (r[x] < r[y])
        swap(x, y);
    p[y] = x;
    if (r[x] == r[y])
        r[x]++;
}

bool used[maxw];

vector<int> e[maxw];

int col[maxw];

bool dfs(int v, int cs = 0){
    col[v] = cs;
    used[v] = 1;
    for (auto i : e[v])
    if (!used[i]){
        if (dfs(i, cs ^ 1))
            return 1;
    }
    else
    if (col[i] != (cs ^ 1))
        return 1;
    return 0;
}

int main()
{
    #ifdef ONPC
    //ifstream cin("a.in");
    //ofstream cout("a.out");
    freopen("a.in", "r", stdin);
    freopen("a.out", "w", stdout);
    #else
    //ifstream cin("sprinklers.in");
    //ofstream cout("sprinklers.out");
    //freopen("road.in", "r", stdin);
    //freopen("road.out", "w", stdout);
    #endif // ONPC
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++){
        cin >> a[i].first >> a[i].second;
        a[i].first--;
        a[i].second--;
        arr[a[i].first] = i;
        arr[a[i].second] = -1;
    }
    for (int i = 0; i < n; i++)
        p[i] = i;
    /*
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            if (a[i].first < a[j].first && a[i].second > a[j].first && a[i].second < a[j].second)
                uni(i, j);
    */
    stack<int> q;
    stack<int> g;
    for (int i = 0; i < 2 * n; i++){
        if (arr[i] < 0){
            q.pop();
            int last = (q.empty() ? inf : a[q.top()].second);
            vector<int> vsp;
            while (!g.empty() && a[g.top()].second < last)
                vsp.push_back(g.top()), g.pop();
            reverse(vsp.begin(), vsp.end());
            for (auto j : vsp)
                q.push(j);
            continue;
        }
        int id = arr[i];
        if (!g.empty() && a[id].second > a[g.top()].second){
            cout << 0;
            return 0;
        }
        int last = -1;
        stack<int> vsp;
        while (!q.empty() && a[q.top()].second < a[id].second){
            if (last != -1){
                if (get(last) == get(q.top()))
                    break;
                uni(last, q.top());
            }
            else
                last = q.top();
            vsp.push(q.top());
            q.pop();
        }
        if (last != -1)
            w.push_back(make_pair(last, id)), g.push(id);
        else
            q.push(id);
        while (!vsp.empty())
            q.push(vsp.top()), vsp.pop();
    }
    for (auto it : w)
    if (get(it.first) == get(it.second)){
        cout << 0;
        return 0;
    }
    for (auto it : w)
        e[get(it.first)].push_back(get(it.second)), e[get(it.second)].push_back(get(it.first));
    int ans = 1;
    for (int i = 0; i < n; i++)
    if (!used[get(i)])
    if (dfs(get(i))){
        cout << 0;
        return 0;
    }
    else
        ans = (ans * 2) % mod;
    cout << ans;
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:295:8: warning: suggest explicit braces to avoid ambiguous 'else' [-Wparentheses]
     if (!used[get(i)])
        ^

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	20 ms	23800 KB	Output is correct
2	Correct	20 ms	23904 KB	Output is correct
3	Correct	19 ms	23976 KB	Output is correct
4	Correct	19 ms	23976 KB	Output is correct
5	Correct	20 ms	24020 KB	Output is correct
6	Correct	21 ms	24028 KB	Output is correct
7	Correct	19 ms	24028 KB	Output is correct
8	Correct	19 ms	24028 KB	Output is correct
9	Correct	22 ms	24084 KB	Output is correct
10	Correct	19 ms	24100 KB	Output is correct
11	Correct	20 ms	24100 KB	Output is correct
12	Correct	19 ms	24100 KB	Output is correct
13	Correct	22 ms	24100 KB	Output is correct
14	Correct	19 ms	24148 KB	Output is correct
15	Correct	19 ms	24148 KB	Output is correct
16	Correct	21 ms	24148 KB	Output is correct
17	Correct	20 ms	24148 KB	Output is correct
18	Correct	21 ms	24156 KB	Output is correct
19	Correct	23 ms	24156 KB	Output is correct
20	Correct	19 ms	24156 KB	Output is correct
21	Correct	20 ms	24156 KB	Output is correct
22	Correct	20 ms	24156 KB	Output is correct
23	Correct	20 ms	24156 KB	Output is correct
24	Correct	21 ms	24156 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	20 ms	23800 KB	Output is correct
2	Correct	20 ms	23904 KB	Output is correct
3	Correct	19 ms	23976 KB	Output is correct
4	Correct	19 ms	23976 KB	Output is correct
5	Correct	20 ms	24020 KB	Output is correct
6	Correct	21 ms	24028 KB	Output is correct
7	Correct	19 ms	24028 KB	Output is correct
8	Correct	19 ms	24028 KB	Output is correct
9	Correct	22 ms	24084 KB	Output is correct
10	Correct	19 ms	24100 KB	Output is correct
11	Correct	20 ms	24100 KB	Output is correct
12	Correct	19 ms	24100 KB	Output is correct
13	Correct	22 ms	24100 KB	Output is correct
14	Correct	19 ms	24148 KB	Output is correct
15	Correct	19 ms	24148 KB	Output is correct
16	Correct	21 ms	24148 KB	Output is correct
17	Correct	20 ms	24148 KB	Output is correct
18	Correct	21 ms	24156 KB	Output is correct
19	Correct	23 ms	24156 KB	Output is correct
20	Correct	19 ms	24156 KB	Output is correct
21	Correct	20 ms	24156 KB	Output is correct
22	Correct	20 ms	24156 KB	Output is correct
23	Correct	20 ms	24156 KB	Output is correct
24	Correct	21 ms	24156 KB	Output is correct
25	Correct	21 ms	24172 KB	Output is correct
26	Correct	20 ms	24172 KB	Output is correct
27	Correct	20 ms	24172 KB	Output is correct
28	Correct	21 ms	24172 KB	Output is correct
29	Correct	21 ms	24172 KB	Output is correct
30	Correct	21 ms	24172 KB	Output is correct
31	Correct	21 ms	24212 KB	Output is correct
32	Correct	23 ms	24212 KB	Output is correct
33	Correct	20 ms	24212 KB	Output is correct
34	Correct	21 ms	24212 KB	Output is correct
35	Correct	23 ms	24212 KB	Output is correct
36	Correct	21 ms	24212 KB	Output is correct
37	Correct	19 ms	24212 KB	Output is correct
38	Correct	20 ms	24212 KB	Output is correct
39	Correct	23 ms	24212 KB	Output is correct
40	Correct	21 ms	24300 KB	Output is correct
41	Correct	20 ms	24300 KB	Output is correct
42	Correct	20 ms	24300 KB	Output is correct
43	Correct	20 ms	24300 KB	Output is correct
44	Correct	21 ms	24428 KB	Output is correct

Subtask #3
56.0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	20 ms	23800 KB	Output is correct
2	Correct	20 ms	23904 KB	Output is correct
3	Correct	19 ms	23976 KB	Output is correct
4	Correct	19 ms	23976 KB	Output is correct
5	Correct	20 ms	24020 KB	Output is correct
6	Correct	21 ms	24028 KB	Output is correct
7	Correct	19 ms	24028 KB	Output is correct
8	Correct	19 ms	24028 KB	Output is correct
9	Correct	22 ms	24084 KB	Output is correct
10	Correct	19 ms	24100 KB	Output is correct
11	Correct	20 ms	24100 KB	Output is correct
12	Correct	19 ms	24100 KB	Output is correct
13	Correct	22 ms	24100 KB	Output is correct
14	Correct	19 ms	24148 KB	Output is correct
15	Correct	19 ms	24148 KB	Output is correct
16	Correct	21 ms	24148 KB	Output is correct
17	Correct	20 ms	24148 KB	Output is correct
18	Correct	21 ms	24156 KB	Output is correct
19	Correct	23 ms	24156 KB	Output is correct
20	Correct	19 ms	24156 KB	Output is correct
21	Correct	20 ms	24156 KB	Output is correct
22	Correct	20 ms	24156 KB	Output is correct
23	Correct	20 ms	24156 KB	Output is correct
24	Correct	21 ms	24156 KB	Output is correct
25	Correct	21 ms	24172 KB	Output is correct
26	Correct	20 ms	24172 KB	Output is correct
27	Correct	20 ms	24172 KB	Output is correct
28	Correct	21 ms	24172 KB	Output is correct
29	Correct	21 ms	24172 KB	Output is correct
30	Correct	21 ms	24172 KB	Output is correct
31	Correct	21 ms	24212 KB	Output is correct
32	Correct	23 ms	24212 KB	Output is correct
33	Correct	20 ms	24212 KB	Output is correct
34	Correct	21 ms	24212 KB	Output is correct
35	Correct	23 ms	24212 KB	Output is correct
36	Correct	21 ms	24212 KB	Output is correct
37	Correct	19 ms	24212 KB	Output is correct
38	Correct	20 ms	24212 KB	Output is correct
39	Correct	23 ms	24212 KB	Output is correct
40	Correct	21 ms	24300 KB	Output is correct
41	Correct	20 ms	24300 KB	Output is correct
42	Correct	20 ms	24300 KB	Output is correct
43	Correct	20 ms	24300 KB	Output is correct
44	Correct	21 ms	24428 KB	Output is correct
45	Correct	90 ms	29012 KB	Output is correct
46	Correct	91 ms	29012 KB	Output is correct
47	Correct	93 ms	29032 KB	Output is correct
48	Correct	88 ms	29032 KB	Output is correct
49	Correct	91 ms	29032 KB	Output is correct
50	Correct	50 ms	29032 KB	Output is correct
51	Correct	56 ms	29032 KB	Output is correct
52	Correct	71 ms	29032 KB	Output is correct
53	Correct	84 ms	29032 KB	Output is correct
54	Correct	44 ms	29032 KB	Output is correct
55	Correct	46 ms	29032 KB	Output is correct
56	Correct	45 ms	29032 KB	Output is correct
57	Correct	98 ms	30160 KB	Output is correct
58	Correct	80 ms	30160 KB	Output is correct
59	Correct	75 ms	30160 KB	Output is correct
60	Correct	88 ms	30160 KB	Output is correct
61	Correct	93 ms	30160 KB	Output is correct
62	Correct	44 ms	30160 KB	Output is correct
63	Correct	46 ms	30160 KB	Output is correct
64	Correct	44 ms	30160 KB	Output is correct
65	Correct	44 ms	30160 KB	Output is correct
66	Correct	43 ms	30160 KB	Output is correct
67	Correct	84 ms	30160 KB	Output is correct
68	Correct	85 ms	30160 KB	Output is correct
69	Correct	93 ms	30160 KB	Output is correct
70	Correct	92 ms	30160 KB	Output is correct
71	Correct	81 ms	30160 KB	Output is correct
72	Correct	83 ms	30160 KB	Output is correct
73	Correct	87 ms	30160 KB	Output is correct
74	Correct	107 ms	30160 KB	Output is correct
75	Correct	110 ms	32408 KB	Output is correct
76	Correct	119 ms	33804 KB	Output is correct
77	Correct	105 ms	33804 KB	Output is correct
78	Correct	90 ms	33804 KB	Output is correct
79	Correct	88 ms	33804 KB	Output is correct

Subtask #4
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	20 ms	23800 KB	Output is correct
2	Correct	20 ms	23904 KB	Output is correct
3	Correct	19 ms	23976 KB	Output is correct
4	Correct	19 ms	23976 KB	Output is correct
5	Correct	20 ms	24020 KB	Output is correct
6	Correct	21 ms	24028 KB	Output is correct
7	Correct	19 ms	24028 KB	Output is correct
8	Correct	19 ms	24028 KB	Output is correct
9	Correct	22 ms	24084 KB	Output is correct
10	Correct	19 ms	24100 KB	Output is correct
11	Correct	20 ms	24100 KB	Output is correct
12	Correct	19 ms	24100 KB	Output is correct
13	Correct	22 ms	24100 KB	Output is correct
14	Correct	19 ms	24148 KB	Output is correct
15	Correct	19 ms	24148 KB	Output is correct
16	Correct	21 ms	24148 KB	Output is correct
17	Correct	20 ms	24148 KB	Output is correct
18	Correct	21 ms	24156 KB	Output is correct
19	Correct	23 ms	24156 KB	Output is correct
20	Correct	19 ms	24156 KB	Output is correct
21	Correct	20 ms	24156 KB	Output is correct
22	Correct	20 ms	24156 KB	Output is correct
23	Correct	20 ms	24156 KB	Output is correct
24	Correct	21 ms	24156 KB	Output is correct
25	Correct	21 ms	24172 KB	Output is correct
26	Correct	20 ms	24172 KB	Output is correct
27	Correct	20 ms	24172 KB	Output is correct
28	Correct	21 ms	24172 KB	Output is correct
29	Correct	21 ms	24172 KB	Output is correct
30	Correct	21 ms	24172 KB	Output is correct
31	Correct	21 ms	24212 KB	Output is correct
32	Correct	23 ms	24212 KB	Output is correct
33	Correct	20 ms	24212 KB	Output is correct
34	Correct	21 ms	24212 KB	Output is correct
35	Correct	23 ms	24212 KB	Output is correct
36	Correct	21 ms	24212 KB	Output is correct
37	Correct	19 ms	24212 KB	Output is correct
38	Correct	20 ms	24212 KB	Output is correct
39	Correct	23 ms	24212 KB	Output is correct
40	Correct	21 ms	24300 KB	Output is correct
41	Correct	20 ms	24300 KB	Output is correct
42	Correct	20 ms	24300 KB	Output is correct
43	Correct	20 ms	24300 KB	Output is correct
44	Correct	21 ms	24428 KB	Output is correct
45	Correct	90 ms	29012 KB	Output is correct
46	Correct	91 ms	29012 KB	Output is correct
47	Correct	93 ms	29032 KB	Output is correct
48	Correct	88 ms	29032 KB	Output is correct
49	Correct	91 ms	29032 KB	Output is correct
50	Correct	50 ms	29032 KB	Output is correct
51	Correct	56 ms	29032 KB	Output is correct
52	Correct	71 ms	29032 KB	Output is correct
53	Correct	84 ms	29032 KB	Output is correct
54	Correct	44 ms	29032 KB	Output is correct
55	Correct	46 ms	29032 KB	Output is correct
56	Correct	45 ms	29032 KB	Output is correct
57	Correct	98 ms	30160 KB	Output is correct
58	Correct	80 ms	30160 KB	Output is correct
59	Correct	75 ms	30160 KB	Output is correct
60	Correct	88 ms	30160 KB	Output is correct
61	Correct	93 ms	30160 KB	Output is correct
62	Correct	44 ms	30160 KB	Output is correct
63	Correct	46 ms	30160 KB	Output is correct
64	Correct	44 ms	30160 KB	Output is correct
65	Correct	44 ms	30160 KB	Output is correct
66	Correct	43 ms	30160 KB	Output is correct
67	Correct	84 ms	30160 KB	Output is correct
68	Correct	85 ms	30160 KB	Output is correct
69	Correct	93 ms	30160 KB	Output is correct
70	Correct	92 ms	30160 KB	Output is correct
71	Correct	81 ms	30160 KB	Output is correct
72	Correct	83 ms	30160 KB	Output is correct
73	Correct	87 ms	30160 KB	Output is correct
74	Correct	107 ms	30160 KB	Output is correct
75	Correct	110 ms	32408 KB	Output is correct
76	Correct	119 ms	33804 KB	Output is correct
77	Correct	105 ms	33804 KB	Output is correct
78	Correct	90 ms	33804 KB	Output is correct
79	Correct	88 ms	33804 KB	Output is correct
80	Correct	1278 ms	71492 KB	Output is correct
81	Correct	1176 ms	71656 KB	Output is correct
82	Correct	1187 ms	71996 KB	Output is correct
83	Correct	1189 ms	71996 KB	Output is correct
84	Correct	1191 ms	71996 KB	Output is correct
85	Correct	582 ms	71996 KB	Output is correct
86	Correct	666 ms	71996 KB	Output is correct
87	Correct	655 ms	71996 KB	Output is correct
88	Correct	792 ms	71996 KB	Output is correct
89	Correct	417 ms	71996 KB	Output is correct
90	Correct	440 ms	71996 KB	Output is correct
91	Correct	459 ms	71996 KB	Output is correct
92	Correct	1360 ms	83908 KB	Output is correct
93	Correct	755 ms	83908 KB	Output is correct
94	Correct	1029 ms	83908 KB	Output is correct
95	Correct	1228 ms	83908 KB	Output is correct
96	Correct	1281 ms	83908 KB	Output is correct
97	Correct	533 ms	83908 KB	Output is correct
98	Correct	634 ms	83908 KB	Output is correct
99	Correct	529 ms	83908 KB	Output is correct
100	Correct	493 ms	83908 KB	Output is correct
101	Correct	479 ms	83908 KB	Output is correct
102	Correct	1289 ms	83908 KB	Output is correct
103	Correct	1124 ms	83908 KB	Output is correct
104	Correct	1390 ms	83908 KB	Output is correct
105	Correct	1275 ms	83908 KB	Output is correct
106	Correct	1047 ms	83908 KB	Output is correct
107	Correct	1080 ms	83908 KB	Output is correct
108	Correct	1131 ms	83908 KB	Output is correct
109	Correct	1213 ms	83908 KB	Output is correct
110	Correct	1499 ms	118584 KB	Output is correct
111	Correct	1548 ms	119396 KB	Output is correct
112	Correct	1571 ms	119396 KB	Output is correct
113	Correct	1264 ms	119396 KB	Output is correct
114	Correct	1420 ms	119396 KB	Output is correct

Submission #40852

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 56.0 / 56.0

Subtask #4 22.0 / 22.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
56.0 / 56.0

Subtask #4
22.0 / 22.0