oj.uz

Submission #24294

# Submission time Handle Problem Language Result Execution time Memory
24294 2017-06-04T06:14:48 Z jiaqiyang Port Facility (JOI17_port_facility) C++14
78 / 100
 3500 ms 473028 KB 
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>

int nextInt() {
  char ch;
  while (!isdigit(ch = getchar())) {}
  int res = ch - '0';
  while (isdigit(ch = getchar())) res = 10 * res + ch - '0';
  return res;
}

const int N = 2000000 + 10, MOD = 1000000007;

int n, a[N], b[N], c[N], id[N];

std::vector<int> adj[N];

void link(int a, int b) {
  adj[a].push_back(b);
  adj[b].push_back(a);
}

std::vector<int> pool[N];

void update(int p, int v) {
  for (; p <= 2 * n; p += p & -p) pool[p].push_back(v);
}

void query(int p, int v) {
  for (; p; p ^= p & -p) {
    if (pool[p].empty()) continue;
    int x = pool[p].back();
    if (b[x] < a[v]) continue;
    for (; !pool[p].empty(); pool[p].pop_back()) {
      int u = pool[p].back();
      if (b[u] >= a[v]) link(u, v); else break;
    }
    pool[p].push_back(x);
  }
}

int tag[N];

void fail() {
  puts("0");
  exit(0);
}

void dfs(int a) {
  int c = 3 - tag[a];
  for (auto b : adj[a]) {
    if (!tag[b]) {
      tag[b] = c;
      dfs(b);
    } else if (tag[b] != c) {
      fail();
    }
  }
}

class {
  int data[N];
  void add(int p, int v) {
    for (; p <= 2 * n; p += p & -p) data[p] += v;
  }
 public:
  void clear() {
    memset(data, 0, sizeof data);
  }
  void add(int l, int r, int v) {
    add(l, v);
    add(r + 1, -v);
  }
  int query(int p) {
    int res = 0;
    for (; p; p ^= p & -p) res += data[p];
    return res;
  }
} bit;

void check(int y) {
  bit.clear();
  for (int i = 1; i <= 2 * n; ++i) {
    int x = id[i];
    if (tag[x] != y) continue;
    if (c[i] > i) {
      bit.add(1, i, 1);
    } else {
      bit.add(1, c[i], -1);
      if (bit.query(c[i])) fail();
      bit.add(c[i], i, 1);
    }
  }
}

int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) a[i] = nextInt(), b[i] = nextInt();
  for (int i = 1; i <= n; ++i) c[a[i]] = b[i], c[b[i]] = a[i], id[a[i]] = id[b[i]] = i;
  for (int i = 1; i <= 2 * n; ++i) {
    if (c[i] > i) continue;
    query(c[i], id[i]);
    update(c[i], id[i]);
  }
  int cnt = 0;
  for (int i = 1; i <= n; ++i) if (!tag[i]) ++cnt, tag[i] = 1, dfs(i);
  check(1);
  check(2);
  int ans = 1;
  while (cnt--) ans = 2 * ans % MOD;
  printf("%d\n", ans);
  return 0;
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:100:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
                  ^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 141800 KB Output is correct
2 Correct 23 ms 141800 KB Output is correct
3 Correct 33 ms 141800 KB Output is correct
4 Correct 29 ms 141800 KB Output is correct
5 Correct 29 ms 141800 KB Output is correct
6 Correct 29 ms 141800 KB Output is correct
7 Correct 29 ms 141800 KB Output is correct
8 Correct 26 ms 141800 KB Output is correct
9 Correct 23 ms 141800 KB Output is correct
10 Correct 23 ms 141800 KB Output is correct
11 Correct 23 ms 141800 KB Output is correct
12 Correct 19 ms 141800 KB Output is correct
13 Correct 29 ms 141800 KB Output is correct
14 Correct 13 ms 141800 KB Output is correct
15 Correct 33 ms 141800 KB Output is correct
16 Correct 19 ms 141800 KB Output is correct
17 Correct 36 ms 141800 KB Output is correct
18 Correct 19 ms 141800 KB Output is correct
19 Correct 26 ms 141800 KB Output is correct
20 Correct 23 ms 141800 KB Output is correct
21 Correct 19 ms 141800 KB Output is correct
22 Correct 23 ms 141800 KB Output is correct
23 Correct 29 ms 141800 KB Output is correct
24 Correct 36 ms 141800 KB Output is correct
25 Correct 36 ms 142064 KB Output is correct
26 Correct 43 ms 142064 KB Output is correct
27 Correct 26 ms 142064 KB Output is correct
28 Correct 43 ms 142064 KB Output is correct
29 Correct 33 ms 142064 KB Output is correct
30 Correct 26 ms 142064 KB Output is correct
31 Correct 29 ms 142064 KB Output is correct
32 Correct 13 ms 142064 KB Output is correct
33 Correct 19 ms 142064 KB Output is correct
34 Correct 16 ms 142064 KB Output is correct
35 Correct 33 ms 141932 KB Output is correct
36 Correct 26 ms 141932 KB Output is correct
37 Correct 23 ms 142200 KB Output is correct
38 Correct 16 ms 142196 KB Output is correct
39 Correct 23 ms 142064 KB Output is correct
40 Correct 26 ms 141932 KB Output is correct
41 Correct 29 ms 141932 KB Output is correct
42 Correct 29 ms 141932 KB Output is correct
43 Correct 36 ms 142064 KB Output is correct
44 Correct 26 ms 142064 KB Output is correct
45 Correct 186 ms 153420 KB Output is correct
46 Correct 209 ms 154128 KB Output is correct
47 Correct 179 ms 153092 KB Output is correct
48 Correct 193 ms 154060 KB Output is correct
49 Correct 176 ms 153180 KB Output is correct
50 Correct 139 ms 153760 KB Output is correct
51 Correct 143 ms 153716 KB Output is correct
52 Correct 99 ms 150704 KB Output is correct
53 Correct 96 ms 148224 KB Output is correct
54 Correct 239 ms 172272 KB Output is correct
55 Correct 166 ms 169364 KB Output is correct
56 Correct 196 ms 168796 KB Output is correct
57 Correct 149 ms 152240 KB Output is correct
58 Correct 113 ms 149164 KB Output is correct
59 Correct 146 ms 150904 KB Output is correct
60 Correct 136 ms 152060 KB Output is correct
61 Correct 166 ms 152568 KB Output is correct
62 Correct 126 ms 151928 KB Output is correct
63 Correct 139 ms 152476 KB Output is correct
64 Correct 133 ms 152772 KB Output is correct
65 Correct 376 ms 163420 KB Output is correct
66 Correct 323 ms 163464 KB Output is correct
67 Correct 166 ms 153136 KB Output is correct
68 Correct 159 ms 153072 KB Output is correct
69 Correct 149 ms 153252 KB Output is correct
70 Correct 126 ms 153248 KB Output is correct
71 Correct 133 ms 152228 KB Output is correct
72 Correct 123 ms 152228 KB Output is correct
73 Correct 133 ms 152704 KB Output is correct
74 Correct 119 ms 152704 KB Output is correct
75 Correct 143 ms 152956 KB Output is correct
76 Correct 156 ms 157572 KB Output is correct
77 Correct 139 ms 157568 KB Output is correct
78 Correct 156 ms 154044 KB Output is correct
79 Correct 166 ms 153468 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 141800 KB Output is correct
2 Correct 23 ms 141800 KB Output is correct
3 Correct 33 ms 141800 KB Output is correct
4 Correct 29 ms 141800 KB Output is correct
5 Correct 29 ms 141800 KB Output is correct
6 Correct 29 ms 141800 KB Output is correct
7 Correct 29 ms 141800 KB Output is correct
8 Correct 26 ms 141800 KB Output is correct
9 Correct 23 ms 141800 KB Output is correct
10 Correct 23 ms 141800 KB Output is correct
11 Correct 23 ms 141800 KB Output is correct
12 Correct 19 ms 141800 KB Output is correct
13 Correct 29 ms 141800 KB Output is correct
14 Correct 13 ms 141800 KB Output is correct
15 Correct 33 ms 141800 KB Output is correct
16 Correct 19 ms 141800 KB Output is correct
17 Correct 36 ms 141800 KB Output is correct
18 Correct 19 ms 141800 KB Output is correct
19 Correct 26 ms 141800 KB Output is correct
20 Correct 23 ms 141800 KB Output is correct
21 Correct 19 ms 141800 KB Output is correct
22 Correct 23 ms 141800 KB Output is correct
23 Correct 29 ms 141800 KB Output is correct
24 Correct 36 ms 141800 KB Output is correct
25 Correct 36 ms 142064 KB Output is correct
26 Correct 43 ms 142064 KB Output is correct
27 Correct 26 ms 142064 KB Output is correct
28 Correct 43 ms 142064 KB Output is correct
29 Correct 33 ms 142064 KB Output is correct
30 Correct 26 ms 142064 KB Output is correct
31 Correct 29 ms 142064 KB Output is correct
32 Correct 13 ms 142064 KB Output is correct
33 Correct 19 ms 142064 KB Output is correct
34 Correct 16 ms 142064 KB Output is correct
35 Correct 33 ms 141932 KB Output is correct
36 Correct 26 ms 141932 KB Output is correct
37 Correct 23 ms 142200 KB Output is correct
38 Correct 16 ms 142196 KB Output is correct
39 Correct 23 ms 142064 KB Output is correct
40 Correct 26 ms 141932 KB Output is correct
41 Correct 29 ms 141932 KB Output is correct
42 Correct 29 ms 141932 KB Output is correct
43 Correct 36 ms 142064 KB Output is correct
44 Correct 26 ms 142064 KB Output is correct
45 Correct 186 ms 153420 KB Output is correct
46 Correct 209 ms 154128 KB Output is correct
47 Correct 179 ms 153092 KB Output is correct
48 Correct 193 ms 154060 KB Output is correct
49 Correct 176 ms 153180 KB Output is correct
50 Correct 139 ms 153760 KB Output is correct
51 Correct 143 ms 153716 KB Output is correct
52 Correct 99 ms 150704 KB Output is correct
53 Correct 96 ms 148224 KB Output is correct
54 Correct 239 ms 172272 KB Output is correct
55 Correct 166 ms 169364 KB Output is correct
56 Correct 196 ms 168796 KB Output is correct
57 Correct 149 ms 152240 KB Output is correct
58 Correct 113 ms 149164 KB Output is correct
59 Correct 146 ms 150904 KB Output is correct
60 Correct 136 ms 152060 KB Output is correct
61 Correct 166 ms 152568 KB Output is correct
62 Correct 126 ms 151928 KB Output is correct
63 Correct 139 ms 152476 KB Output is correct
64 Correct 133 ms 152772 KB Output is correct
65 Correct 376 ms 163420 KB Output is correct
66 Correct 323 ms 163464 KB Output is correct
67 Correct 166 ms 153136 KB Output is correct
68 Correct 159 ms 153072 KB Output is correct
69 Correct 149 ms 153252 KB Output is correct
70 Correct 126 ms 153248 KB Output is correct
71 Correct 133 ms 152228 KB Output is correct
72 Correct 123 ms 152228 KB Output is correct
73 Correct 133 ms 152704 KB Output is correct
74 Correct 119 ms 152704 KB Output is correct
75 Correct 143 ms 152956 KB Output is correct
76 Correct 156 ms 157572 KB Output is correct
77 Correct 139 ms 157568 KB Output is correct
78 Correct 156 ms 154044 KB Output is correct
79 Correct 166 ms 153468 KB Output is correct
80 Correct 2373 ms 267840 KB Output is correct
81 Correct 2289 ms 267180 KB Output is correct
82 Correct 2426 ms 261584 KB Output is correct
83 Correct 2393 ms 267264 KB Output is correct
84 Correct 2476 ms 267944 KB Output is correct
85 Correct 1666 ms 265028 KB Output is correct
86 Correct 1713 ms 268416 KB Output is correct
87 Correct 1296 ms 236076 KB Output is correct
88 Correct 946 ms 209268 KB Output is correct
89 Correct 2943 ms 473028 KB Output is correct
90 Correct 2869 ms 456488 KB Output is correct
91 Correct 2733 ms 457752 KB Output is correct
92 Correct 1973 ms 251616 KB Output is correct
93 Correct 1169 ms 220416 KB Output is correct
94 Correct 1626 ms 245448 KB Output is correct
95 Correct 1913 ms 255644 KB Output is correct
96 Correct 2403 ms 260344 KB Output is correct
97 Correct 1213 ms 250576 KB Output is correct
98 Correct 1369 ms 257552 KB Output is correct
99 Correct 1596 ms 264800 KB Output is correct
100 Execution timed out 3500 ms 306448 KB Execution timed out
101 Halted 0 ms 0 KB -