Submission #31102

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
31102	2017-08-09T22:29:34 Z	RezwanArefin01	Port Facility (JOI17_port_facility)	C++14	22 / 100	6000 ms	59776 KB

port_facility

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
const int maxn = 1e6 + 10;
vector<int> adj[maxn]; 
int col[maxn], n; 
 
struct range{
    int l, r; 
    bool operator < (const range &p) const {
        return l == p.l ? r < p.r : l < p.l;
    }
} v[maxn];
 
bool cant(int i, int j) {
    return (v[i].l < v[j].l && v[j].l < v[i].r && v[j].r > v[i].r);
}
 
bool bfs(int r) {
    col[r] = 0; 
    queue<int> Q;
    Q.push(r); 
    while(!Q.empty()) {
        int u = Q.front(); Q.pop(); 
        for(int v : adj[u]) {
            if(col[v] == -1) {
                col[v] = col[u] ^ 1; 
                Q.push(v);
            } else if(col[v] == col[u]) return 0;
        }
    } return 1; 
}
int p[maxn * 2 + 100];
int find(int u) { return p[u] == u ? u : p[u] = find(p[u]); }
void construct() {
    sort(v, v+n);
    range q[n]; 
    for(int i = 0; i <= 2*n; i++) 
        p[i] = i;
    for(int i = 0; i < n; i++) {
        range xx = {v[i].r, 0}; 
        int x = lower_bound(v, v+n, v[i]) - v; 
        int y = upper_bound(v, v+n, xx) - v;
        for(int j = x; j <= y; j++) {
            if(cant(i, j) || cant(j, i)) {
                adj[i].push_back(j);
                adj[j].push_back(i); 
                p[find(i)] = find(j + n);
                p[find(j)] = find(i + n);


                if(find(i) == find(i + n) || find(j) == find(j + n)) 
                    { puts("0"); exit(0); }
                //cout << i << " " << v[j].r << endl;
            }
        }   
    }
}
int main(int argc, char const *argv[]) {
#ifdef LOCAL_TESTING
    freopen("in", "r", stdin);
#endif
    cin >> n; 
    for(int i = 0; i < n; i++) 
        cin >> v[i].l >> v[i].r; 
 
    construct(); 
    int comp = 0;

    memset(col, -1, sizeof col);
    for(int i = 0; i < n; i++) {
        if(col[i] == -1) {
            comp++;
            if(!bfs(i)) return cout << 0 << endl, 0; 
            //for(int j=0; j < n; j++) cout << col[i] <<" "; cout << endl;
        }
    }
    int ans = 1; 
    for(int i = 0; i < comp; i++) {
        ans = (ans * 2) % ll(1e9 + 7); 
    } cout << ans << endl;
}

Compilation message

port_facility.cpp: In function 'void construct()':
port_facility.cpp:38:11: warning: unused variable 'q' [-Wunused-variable]
     range q[n]; 
           ^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	44992 KB	Output is correct
2	Correct	13 ms	44992 KB	Output is correct
3	Correct	6 ms	44992 KB	Output is correct
4	Correct	3 ms	44992 KB	Output is correct
5	Correct	13 ms	44992 KB	Output is correct
6	Correct	3 ms	44992 KB	Output is correct
7	Correct	9 ms	44992 KB	Output is correct
8	Correct	6 ms	44992 KB	Output is correct
9	Correct	3 ms	44992 KB	Output is correct
10	Correct	3 ms	44992 KB	Output is correct
11	Correct	6 ms	44992 KB	Output is correct
12	Correct	6 ms	44992 KB	Output is correct
13	Correct	3 ms	44992 KB	Output is correct
14	Correct	9 ms	44992 KB	Output is correct
15	Correct	3 ms	44992 KB	Output is correct
16	Correct	3 ms	44992 KB	Output is correct
17	Correct	3 ms	44992 KB	Output is correct
18	Correct	3 ms	44992 KB	Output is correct
19	Correct	6 ms	44992 KB	Output is correct
20	Correct	3 ms	44992 KB	Output is correct
21	Correct	3 ms	44992 KB	Output is correct
22	Correct	9 ms	44992 KB	Output is correct
23	Correct	6 ms	44992 KB	Output is correct
24	Correct	3 ms	44992 KB	Output is correct
25	Correct	16 ms	45256 KB	Output is correct
26	Correct	23 ms	45388 KB	Output is correct
27	Correct	16 ms	45256 KB	Output is correct
28	Correct	9 ms	45520 KB	Output is correct
29	Correct	19 ms	45388 KB	Output is correct
30	Correct	13 ms	45388 KB	Output is correct
31	Correct	19 ms	45256 KB	Output is correct
32	Correct	13 ms	45256 KB	Output is correct
33	Correct	13 ms	45124 KB	Output is correct
34	Correct	6 ms	45124 KB	Output is correct
35	Correct	6 ms	44992 KB	Output is correct
36	Correct	19 ms	44992 KB	Output is correct
37	Correct	13 ms	45124 KB	Output is correct
38	Correct	6 ms	44992 KB	Output is correct
39	Correct	13 ms	45124 KB	Output is correct
40	Correct	9 ms	44992 KB	Output is correct
41	Correct	53 ms	53044 KB	Output is correct
42	Correct	59 ms	53044 KB	Output is correct
43	Correct	6 ms	45124 KB	Output is correct
44	Correct	9 ms	45124 KB	Output is correct

Subtask #3
0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	44992 KB	Output is correct
2	Correct	13 ms	44992 KB	Output is correct
3	Correct	6 ms	44992 KB	Output is correct
4	Correct	3 ms	44992 KB	Output is correct
5	Correct	13 ms	44992 KB	Output is correct
6	Correct	3 ms	44992 KB	Output is correct
7	Correct	9 ms	44992 KB	Output is correct
8	Correct	6 ms	44992 KB	Output is correct
9	Correct	3 ms	44992 KB	Output is correct
10	Correct	3 ms	44992 KB	Output is correct
11	Correct	6 ms	44992 KB	Output is correct
12	Correct	6 ms	44992 KB	Output is correct
13	Correct	3 ms	44992 KB	Output is correct
14	Correct	9 ms	44992 KB	Output is correct
15	Correct	3 ms	44992 KB	Output is correct
16	Correct	3 ms	44992 KB	Output is correct
17	Correct	3 ms	44992 KB	Output is correct
18	Correct	3 ms	44992 KB	Output is correct
19	Correct	6 ms	44992 KB	Output is correct
20	Correct	3 ms	44992 KB	Output is correct
21	Correct	3 ms	44992 KB	Output is correct
22	Correct	9 ms	44992 KB	Output is correct
23	Correct	6 ms	44992 KB	Output is correct
24	Correct	3 ms	44992 KB	Output is correct
25	Correct	16 ms	45256 KB	Output is correct
26	Correct	23 ms	45388 KB	Output is correct
27	Correct	16 ms	45256 KB	Output is correct
28	Correct	9 ms	45520 KB	Output is correct
29	Correct	19 ms	45388 KB	Output is correct
30	Correct	13 ms	45388 KB	Output is correct
31	Correct	19 ms	45256 KB	Output is correct
32	Correct	13 ms	45256 KB	Output is correct
33	Correct	13 ms	45124 KB	Output is correct
34	Correct	6 ms	45124 KB	Output is correct
35	Correct	6 ms	44992 KB	Output is correct
36	Correct	19 ms	44992 KB	Output is correct
37	Correct	13 ms	45124 KB	Output is correct
38	Correct	6 ms	44992 KB	Output is correct
39	Correct	13 ms	45124 KB	Output is correct
40	Correct	9 ms	44992 KB	Output is correct
41	Correct	53 ms	53044 KB	Output is correct
42	Correct	59 ms	53044 KB	Output is correct
43	Correct	6 ms	45124 KB	Output is correct
44	Correct	9 ms	45124 KB	Output is correct
45	Execution timed out	6000 ms	59776 KB	Execution timed out
46	Halted	0 ms	0 KB	-

Subtask #4
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	44992 KB	Output is correct
2	Correct	13 ms	44992 KB	Output is correct
3	Correct	6 ms	44992 KB	Output is correct
4	Correct	3 ms	44992 KB	Output is correct
5	Correct	13 ms	44992 KB	Output is correct
6	Correct	3 ms	44992 KB	Output is correct
7	Correct	9 ms	44992 KB	Output is correct
8	Correct	6 ms	44992 KB	Output is correct
9	Correct	3 ms	44992 KB	Output is correct
10	Correct	3 ms	44992 KB	Output is correct
11	Correct	6 ms	44992 KB	Output is correct
12	Correct	6 ms	44992 KB	Output is correct
13	Correct	3 ms	44992 KB	Output is correct
14	Correct	9 ms	44992 KB	Output is correct
15	Correct	3 ms	44992 KB	Output is correct
16	Correct	3 ms	44992 KB	Output is correct
17	Correct	3 ms	44992 KB	Output is correct
18	Correct	3 ms	44992 KB	Output is correct
19	Correct	6 ms	44992 KB	Output is correct
20	Correct	3 ms	44992 KB	Output is correct
21	Correct	3 ms	44992 KB	Output is correct
22	Correct	9 ms	44992 KB	Output is correct
23	Correct	6 ms	44992 KB	Output is correct
24	Correct	3 ms	44992 KB	Output is correct
25	Correct	16 ms	45256 KB	Output is correct
26	Correct	23 ms	45388 KB	Output is correct
27	Correct	16 ms	45256 KB	Output is correct
28	Correct	9 ms	45520 KB	Output is correct
29	Correct	19 ms	45388 KB	Output is correct
30	Correct	13 ms	45388 KB	Output is correct
31	Correct	19 ms	45256 KB	Output is correct
32	Correct	13 ms	45256 KB	Output is correct
33	Correct	13 ms	45124 KB	Output is correct
34	Correct	6 ms	45124 KB	Output is correct
35	Correct	6 ms	44992 KB	Output is correct
36	Correct	19 ms	44992 KB	Output is correct
37	Correct	13 ms	45124 KB	Output is correct
38	Correct	6 ms	44992 KB	Output is correct
39	Correct	13 ms	45124 KB	Output is correct
40	Correct	9 ms	44992 KB	Output is correct
41	Correct	53 ms	53044 KB	Output is correct
42	Correct	59 ms	53044 KB	Output is correct
43	Correct	6 ms	45124 KB	Output is correct
44	Correct	9 ms	45124 KB	Output is correct
45	Execution timed out	6000 ms	59776 KB	Execution timed out
46	Halted	0 ms	0 KB	-

Submission #31102

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 56.0

Subtask #4 0 / 22.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 56.0

Subtask #4
0 / 22.0