oj.uz

Submission #190740

# Submission time Handle Problem Language Result Execution time Memory
190740 2020-01-14T08:24:45 Z rkm0959 Port Facility (JOI17_port_facility) C++14
100 / 100
 3242 ms 227604 KB 
#include <bits/stdc++.h>
#define fio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
typedef long double ldb;
typedef long long int ll;
typedef unsigned long long int ull;
typedef complex<double> base;
ll mod=1e9+7;

vector<int> must_equal[1111111];
int fuck[1111111], n, cur, cnt;
int indx[2222222];
pair<int, int> a[1111111];
int vis[1111111], vis_2[1111111];
int whi[1111111], col[1111111];
vector<int> con[1111111];
set<int> S, ALV; bool pos=true;
set<int>::iterator it, itp;
queue<int> Q;

void merge(int idx, int L, int R) // [L, R] merge
{
    it=ALV.lower_bound(L);
    if(it!=ALV.end() && (*it)<=R) { fuck[idx]=indx[(*it)]; }
    it=S.lower_bound(L); int myloc, yourloc;
    while(1)
    {
        if(it==S.end()) break; myloc=(*it);
        itp=ALV.upper_bound(myloc);
        if(itp==ALV.end() || (*itp)>R) break;
        yourloc=(*itp);
        must_equal[indx[myloc]].push_back(indx[yourloc]);
        must_equal[indx[yourloc]].push_back(indx[myloc]);
        // now connect (*it) and (*itp)
        it=S.erase(it);
    }
}

void bfs(int x)
{
    whi[x]=cur; vis[x]=1; Q.push(x);
    while(!Q.empty())
    {
        int wow=Q.front(); Q.pop();
        for(int i=0 ; i<must_equal[wow].size() ; i++)
        {
            int nxt=must_equal[wow][i];
            if(!vis[nxt]) { whi[nxt]=cur; vis[nxt]=1; Q.push(nxt); }
        }
    }
}

void bfs_2(int x)
{
    col[x]=1; vis_2[x]=1; Q.push(x);
    while(!Q.empty())
    {
        int wow=Q.front(); Q.pop();
        for(int i=0 ; i<con[wow].size() ; i++)
        {
            int nxt=con[wow][i];
            if(vis_2[nxt] && col[nxt]+col[wow]!=3) pos=false;
            if(!vis_2[nxt]) { col[nxt]=3-col[wow]; vis_2[nxt]=1; Q.push(nxt); }
        }
    }
}

int main(void)
{
    fio; int i; cin>>n;
    for(i=1 ; i<=n ; i++) cin>>a[i].first>>a[i].second;
    sort(a+1, a+n+1);
    for(i=1 ; i<=n ; i++) indx[a[i].first]=i, indx[a[i].second]=i;
    for(i=1 ; i<=n ; i++)
    {
        merge(i, a[i].first+1, a[i].second-1);
        S.insert(a[i].second); ALV.insert(a[i].second);
    }
    for(i=1 ; i<=n ; i++) if(!vis[i]) { cur++; bfs(i); }
    for(i=1 ; i<=n ; i++)
    {
        if(fuck[i])
        {
            con[whi[fuck[i]]].push_back(whi[i]);
            con[whi[i]].push_back(whi[fuck[i]]);
        }
    }
    for(i=1 ; i<=cur ; i++) if(!vis_2[i]) { cnt++; bfs_2(i); }
    ll ans=1; for(i=1 ; i<=cnt ; i++) ans=(2*ans)%mod;
    if(pos) cout<<ans; 
    else cout<<0; return 0;
}

Compilation message

port_facility.cpp: In function 'void merge(int, int, int)':
port_facility.cpp:28:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
         if(it==S.end()) break; myloc=(*it);
         ^~
port_facility.cpp:28:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
         if(it==S.end()) break; myloc=(*it);
                                ^~~~~
port_facility.cpp: In function 'void bfs(int)':
port_facility.cpp:45:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0 ; i<must_equal[wow].size() ; i++)
                       ~^~~~~~~~~~~~~~~~~~~~~~~
port_facility.cpp: In function 'void bfs_2(int)':
port_facility.cpp:59:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0 ; i<con[wow].size() ; i++)
                       ~^~~~~~~~~~~~~~~~
port_facility.cpp: In function 'int main()':
port_facility.cpp:91:5: warning: this 'else' clause does not guard... [-Wmisleading-indentation]
     else cout<<0; return 0;
     ^~~~
port_facility.cpp:91:19: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'else'
     else cout<<0; return 0;
                   ^~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 52572 KB Output is correct
2 Correct 52 ms 52724 KB Output is correct
3 Correct 51 ms 52600 KB Output is correct
4 Correct 51 ms 52580 KB Output is correct
5 Correct 51 ms 52624 KB Output is correct
6 Correct 51 ms 52572 KB Output is correct
7 Correct 51 ms 52624 KB Output is correct
8 Correct 51 ms 52600 KB Output is correct
9 Correct 52 ms 52408 KB Output is correct
10 Correct 51 ms 52600 KB Output is correct
11 Correct 52 ms 52548 KB Output is correct
12 Correct 50 ms 52724 KB Output is correct
13 Correct 51 ms 52600 KB Output is correct
14 Correct 51 ms 52600 KB Output is correct
15 Correct 51 ms 52600 KB Output is correct
16 Correct 60 ms 52644 KB Output is correct
17 Correct 51 ms 52600 KB Output is correct
18 Correct 62 ms 52600 KB Output is correct
19 Correct 64 ms 52600 KB Output is correct
20 Correct 45 ms 52600 KB Output is correct
21 Correct 51 ms 52592 KB Output is correct
22 Correct 52 ms 52580 KB Output is correct
23 Correct 51 ms 52544 KB Output is correct
24 Correct 51 ms 52584 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 52572 KB Output is correct
2 Correct 52 ms 52724 KB Output is correct
3 Correct 51 ms 52600 KB Output is correct
4 Correct 51 ms 52580 KB Output is correct
5 Correct 51 ms 52624 KB Output is correct
6 Correct 51 ms 52572 KB Output is correct
7 Correct 51 ms 52624 KB Output is correct
8 Correct 51 ms 52600 KB Output is correct
9 Correct 52 ms 52408 KB Output is correct
10 Correct 51 ms 52600 KB Output is correct
11 Correct 52 ms 52548 KB Output is correct
12 Correct 50 ms 52724 KB Output is correct
13 Correct 51 ms 52600 KB Output is correct
14 Correct 51 ms 52600 KB Output is correct
15 Correct 51 ms 52600 KB Output is correct
16 Correct 60 ms 52644 KB Output is correct
17 Correct 51 ms 52600 KB Output is correct
18 Correct 62 ms 52600 KB Output is correct
19 Correct 64 ms 52600 KB Output is correct
20 Correct 45 ms 52600 KB Output is correct
21 Correct 51 ms 52592 KB Output is correct
22 Correct 52 ms 52580 KB Output is correct
23 Correct 51 ms 52544 KB Output is correct
24 Correct 51 ms 52584 KB Output is correct
25 Correct 53 ms 52840 KB Output is correct
26 Correct 56 ms 52828 KB Output is correct
27 Correct 55 ms 52924 KB Output is correct
28 Correct 54 ms 52828 KB Output is correct
29 Correct 52 ms 52856 KB Output is correct
30 Correct 53 ms 52856 KB Output is correct
31 Correct 54 ms 52856 KB Output is correct
32 Correct 54 ms 52856 KB Output is correct
33 Correct 54 ms 52840 KB Output is correct
34 Correct 40 ms 52732 KB Output is correct
35 Correct 53 ms 52828 KB Output is correct
36 Correct 61 ms 52828 KB Output is correct
37 Correct 53 ms 52780 KB Output is correct
38 Correct 54 ms 52772 KB Output is correct
39 Correct 53 ms 53028 KB Output is correct
40 Correct 53 ms 52884 KB Output is correct
41 Correct 52 ms 52908 KB Output is correct
42 Correct 53 ms 52876 KB Output is correct
43 Correct 54 ms 52956 KB Output is correct
44 Correct 53 ms 52956 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 52572 KB Output is correct
2 Correct 52 ms 52724 KB Output is correct
3 Correct 51 ms 52600 KB Output is correct
4 Correct 51 ms 52580 KB Output is correct
5 Correct 51 ms 52624 KB Output is correct
6 Correct 51 ms 52572 KB Output is correct
7 Correct 51 ms 52624 KB Output is correct
8 Correct 51 ms 52600 KB Output is correct
9 Correct 52 ms 52408 KB Output is correct
10 Correct 51 ms 52600 KB Output is correct
11 Correct 52 ms 52548 KB Output is correct
12 Correct 50 ms 52724 KB Output is correct
13 Correct 51 ms 52600 KB Output is correct
14 Correct 51 ms 52600 KB Output is correct
15 Correct 51 ms 52600 KB Output is correct
16 Correct 60 ms 52644 KB Output is correct
17 Correct 51 ms 52600 KB Output is correct
18 Correct 62 ms 52600 KB Output is correct
19 Correct 64 ms 52600 KB Output is correct
20 Correct 45 ms 52600 KB Output is correct
21 Correct 51 ms 52592 KB Output is correct
22 Correct 52 ms 52580 KB Output is correct
23 Correct 51 ms 52544 KB Output is correct
24 Correct 51 ms 52584 KB Output is correct
25 Correct 53 ms 52840 KB Output is correct
26 Correct 56 ms 52828 KB Output is correct
27 Correct 55 ms 52924 KB Output is correct
28 Correct 54 ms 52828 KB Output is correct
29 Correct 52 ms 52856 KB Output is correct
30 Correct 53 ms 52856 KB Output is correct
31 Correct 54 ms 52856 KB Output is correct
32 Correct 54 ms 52856 KB Output is correct
33 Correct 54 ms 52840 KB Output is correct
34 Correct 40 ms 52732 KB Output is correct
35 Correct 53 ms 52828 KB Output is correct
36 Correct 61 ms 52828 KB Output is correct
37 Correct 53 ms 52780 KB Output is correct
38 Correct 54 ms 52772 KB Output is correct
39 Correct 53 ms 53028 KB Output is correct
40 Correct 53 ms 52884 KB Output is correct
41 Correct 52 ms 52908 KB Output is correct
42 Correct 53 ms 52876 KB Output is correct
43 Correct 54 ms 52956 KB Output is correct
44 Correct 53 ms 52956 KB Output is correct
45 Correct 199 ms 67632 KB Output is correct
46 Correct 190 ms 67532 KB Output is correct
47 Correct 200 ms 67484 KB Output is correct
48 Correct 193 ms 67420 KB Output is correct
49 Correct 186 ms 67448 KB Output is correct
50 Correct 182 ms 67460 KB Output is correct
51 Correct 193 ms 67352 KB Output is correct
52 Correct 187 ms 66296 KB Output is correct
53 Correct 224 ms 66328 KB Output is correct
54 Correct 177 ms 65560 KB Output is correct
55 Correct 196 ms 65524 KB Output is correct
56 Correct 173 ms 65588 KB Output is correct
57 Correct 200 ms 69852 KB Output is correct
58 Correct 190 ms 66300 KB Output is correct
59 Correct 175 ms 67440 KB Output is correct
60 Correct 175 ms 68188 KB Output is correct
61 Correct 189 ms 67960 KB Output is correct
62 Correct 180 ms 67068 KB Output is correct
63 Correct 185 ms 67824 KB Output is correct
64 Correct 187 ms 67816 KB Output is correct
65 Correct 226 ms 65768 KB Output is correct
66 Correct 208 ms 65892 KB Output is correct
67 Correct 216 ms 68184 KB Output is correct
68 Correct 220 ms 68176 KB Output is correct
69 Correct 209 ms 68948 KB Output is correct
70 Correct 214 ms 68988 KB Output is correct
71 Correct 215 ms 68080 KB Output is correct
72 Correct 204 ms 68196 KB Output is correct
73 Correct 209 ms 68984 KB Output is correct
74 Correct 218 ms 68976 KB Output is correct
75 Correct 211 ms 69884 KB Output is correct
76 Correct 209 ms 69880 KB Output is correct
77 Correct 210 ms 69896 KB Output is correct
78 Correct 191 ms 67528 KB Output is correct
79 Correct 191 ms 67448 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 52572 KB Output is correct
2 Correct 52 ms 52724 KB Output is correct
3 Correct 51 ms 52600 KB Output is correct
4 Correct 51 ms 52580 KB Output is correct
5 Correct 51 ms 52624 KB Output is correct
6 Correct 51 ms 52572 KB Output is correct
7 Correct 51 ms 52624 KB Output is correct
8 Correct 51 ms 52600 KB Output is correct
9 Correct 52 ms 52408 KB Output is correct
10 Correct 51 ms 52600 KB Output is correct
11 Correct 52 ms 52548 KB Output is correct
12 Correct 50 ms 52724 KB Output is correct
13 Correct 51 ms 52600 KB Output is correct
14 Correct 51 ms 52600 KB Output is correct
15 Correct 51 ms 52600 KB Output is correct
16 Correct 60 ms 52644 KB Output is correct
17 Correct 51 ms 52600 KB Output is correct
18 Correct 62 ms 52600 KB Output is correct
19 Correct 64 ms 52600 KB Output is correct
20 Correct 45 ms 52600 KB Output is correct
21 Correct 51 ms 52592 KB Output is correct
22 Correct 52 ms 52580 KB Output is correct
23 Correct 51 ms 52544 KB Output is correct
24 Correct 51 ms 52584 KB Output is correct
25 Correct 53 ms 52840 KB Output is correct
26 Correct 56 ms 52828 KB Output is correct
27 Correct 55 ms 52924 KB Output is correct
28 Correct 54 ms 52828 KB Output is correct
29 Correct 52 ms 52856 KB Output is correct
30 Correct 53 ms 52856 KB Output is correct
31 Correct 54 ms 52856 KB Output is correct
32 Correct 54 ms 52856 KB Output is correct
33 Correct 54 ms 52840 KB Output is correct
34 Correct 40 ms 52732 KB Output is correct
35 Correct 53 ms 52828 KB Output is correct
36 Correct 61 ms 52828 KB Output is correct
37 Correct 53 ms 52780 KB Output is correct
38 Correct 54 ms 52772 KB Output is correct
39 Correct 53 ms 53028 KB Output is correct
40 Correct 53 ms 52884 KB Output is correct
41 Correct 52 ms 52908 KB Output is correct
42 Correct 53 ms 52876 KB Output is correct
43 Correct 54 ms 52956 KB Output is correct
44 Correct 53 ms 52956 KB Output is correct
45 Correct 199 ms 67632 KB Output is correct
46 Correct 190 ms 67532 KB Output is correct
47 Correct 200 ms 67484 KB Output is correct
48 Correct 193 ms 67420 KB Output is correct
49 Correct 186 ms 67448 KB Output is correct
50 Correct 182 ms 67460 KB Output is correct
51 Correct 193 ms 67352 KB Output is correct
52 Correct 187 ms 66296 KB Output is correct
53 Correct 224 ms 66328 KB Output is correct
54 Correct 177 ms 65560 KB Output is correct
55 Correct 196 ms 65524 KB Output is correct
56 Correct 173 ms 65588 KB Output is correct
57 Correct 200 ms 69852 KB Output is correct
58 Correct 190 ms 66300 KB Output is correct
59 Correct 175 ms 67440 KB Output is correct
60 Correct 175 ms 68188 KB Output is correct
61 Correct 189 ms 67960 KB Output is correct
62 Correct 180 ms 67068 KB Output is correct
63 Correct 185 ms 67824 KB Output is correct
64 Correct 187 ms 67816 KB Output is correct
65 Correct 226 ms 65768 KB Output is correct
66 Correct 208 ms 65892 KB Output is correct
67 Correct 216 ms 68184 KB Output is correct
68 Correct 220 ms 68176 KB Output is correct
69 Correct 209 ms 68948 KB Output is correct
70 Correct 214 ms 68988 KB Output is correct
71 Correct 215 ms 68080 KB Output is correct
72 Correct 204 ms 68196 KB Output is correct
73 Correct 209 ms 68984 KB Output is correct
74 Correct 218 ms 68976 KB Output is correct
75 Correct 211 ms 69884 KB Output is correct
76 Correct 209 ms 69880 KB Output is correct
77 Correct 210 ms 69896 KB Output is correct
78 Correct 191 ms 67528 KB Output is correct
79 Correct 191 ms 67448 KB Output is correct
80 Correct 1696 ms 203112 KB Output is correct
81 Correct 1707 ms 203096 KB Output is correct
82 Correct 1732 ms 203508 KB Output is correct
83 Correct 1690 ms 202920 KB Output is correct
84 Correct 1701 ms 202872 KB Output is correct
85 Correct 1807 ms 202044 KB Output is correct
86 Correct 1736 ms 202036 KB Output is correct
87 Correct 1760 ms 192384 KB Output is correct
88 Correct 2047 ms 192480 KB Output is correct
89 Correct 1635 ms 181148 KB Output is correct
90 Correct 1584 ms 182904 KB Output is correct
91 Correct 1582 ms 183008 KB Output is correct
92 Correct 1933 ms 224932 KB Output is correct
93 Correct 1889 ms 190392 KB Output is correct
94 Correct 1456 ms 207328 KB Output is correct
95 Correct 1586 ms 209120 KB Output is correct
96 Correct 1587 ms 203312 KB Output is correct
97 Correct 1544 ms 203428 KB Output is correct
98 Correct 1717 ms 205276 KB Output is correct
99 Correct 1773 ms 198680 KB Output is correct
100 Correct 3242 ms 182332 KB Output is correct
101 Correct 3178 ms 180376 KB Output is correct
102 Correct 2221 ms 208476 KB Output is correct
103 Correct 2199 ms 209716 KB Output is correct
104 Correct 2163 ms 217168 KB Output is correct
105 Correct 2185 ms 216024 KB Output is correct
106 Correct 2177 ms 207864 KB Output is correct
107 Correct 2187 ms 209648 KB Output is correct
108 Correct 2289 ms 216696 KB Output is correct
109 Correct 2207 ms 217436 KB Output is correct
110 Correct 2109 ms 224608 KB Output is correct
111 Correct 2114 ms 227604 KB Output is correct
112 Correct 2127 ms 225136 KB Output is correct
113 Correct 1643 ms 202816 KB Output is correct
114 Correct 1710 ms 200588 KB Output is correct