oj.uz

Submission #866744

# Submission time Handle Problem Language Result Execution time Memory
866744 2023-10-27T01:53:38 Z mgl_diamond Port Facility (JOI17_port_facility) C++17
22 / 100
 6000 ms 12884 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;

#define foru(i, l, r) for(int i=(l); i<=(r); ++i)
#define ford(i, l, r) for(int i=(l); i>=(r); --i)
#define fore(x, v) for(auto &x : v)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define file "input"

void setIO() {
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  if (fopen(file".inp", "r")) {
    freopen(file".inp", "r", stdin);
    freopen(file".out", "w", stdout);
  }
}

const int MOD = 1e9+7;
const int N = 1e6+5;

int n, anc[2*N];
ii cont[N];
set<ii> hold;

int root(int u) {
  return anc[u] < 0 ? u : anc[u] = root(anc[u]);
}

void join(int u, int v) {
  if ((u = root(u)) == (v = root(v))) return;
  if (anc[u] > anc[v]) swap(u, v);
  anc[u] += anc[v];
  anc[v] = u;
}

int main() {
  setIO();
  cin >> n;

  foru(i, 1, n) {
    int l, r;
    cin >> l >> r;
    cont[i] = {l, r};
  }

  foru(i, 1, 2*n) {
    anc[i] = -1;
  }

  sort(cont+1, cont+n+1);

  foru(i, 1, n) {
    int l = cont[i].fi, r = cont[i].se;
    auto lb = hold.lower_bound({l, 0});
    auto rb = hold.lower_bound({r, 0});

    if (lb == hold.end() || lb -> first >= r) {
      hold.insert({r, i});
      continue;
    }

    while (true) {
      join(lb -> second, i + n);
      join(lb -> second + n, i);
      if (lb -> first == prev(rb) -> first) break;
      ++lb;
    }
    
    if (root(i) == root(i+n)) { 
      cout << 0;
      return 0;
    }

    hold.insert({r, i});
  }

  int ans = 1;
  foru(i, 1, n) if (root(i) == i) ans = ans * 2 % MOD;
  cout << ans;
}

Compilation message

port_facility.cpp: In function 'void setIO()':
port_facility.cpp:19:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     freopen(file".inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
port_facility.cpp:20:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     freopen(file".out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 2 ms 2392 KB Output is correct
26 Correct 2 ms 2396 KB Output is correct
27 Correct 2 ms 2396 KB Output is correct
28 Correct 2 ms 2396 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2396 KB Output is correct
31 Correct 3 ms 2528 KB Output is correct
32 Correct 2 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2392 KB Output is correct
37 Correct 1 ms 2392 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 15 ms 2396 KB Output is correct
42 Correct 15 ms 2396 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 1 ms 2440 KB Output is correct
45 Correct 84 ms 11348 KB Output is correct
46 Correct 143 ms 11344 KB Output is correct
47 Correct 69 ms 11344 KB Output is correct
48 Correct 149 ms 11400 KB Output is correct
49 Correct 75 ms 11344 KB Output is correct
50 Correct 74 ms 7620 KB Output is correct
51 Correct 59 ms 8628 KB Output is correct
52 Correct 44 ms 11276 KB Output is correct
53 Correct 44 ms 11352 KB Output is correct
54 Correct 18 ms 6748 KB Output is correct
55 Correct 20 ms 8028 KB Output is correct
56 Correct 19 ms 8016 KB Output is correct
57 Correct 52 ms 12628 KB Output is correct
58 Correct 46 ms 12532 KB Output is correct
59 Correct 48 ms 12884 KB Output is correct
60 Correct 47 ms 12624 KB Output is correct
61 Correct 50 ms 12624 KB Output is correct
62 Correct 20 ms 8040 KB Output is correct
63 Correct 21 ms 8060 KB Output is correct
64 Correct 20 ms 7920 KB Output is correct
65 Correct 20 ms 8028 KB Output is correct
66 Correct 22 ms 8044 KB Output is correct
67 Execution timed out 6019 ms 10900 KB Time limit exceeded
68 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 2 ms 2392 KB Output is correct
26 Correct 2 ms 2396 KB Output is correct
27 Correct 2 ms 2396 KB Output is correct
28 Correct 2 ms 2396 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2396 KB Output is correct
31 Correct 3 ms 2528 KB Output is correct
32 Correct 2 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2392 KB Output is correct
37 Correct 1 ms 2392 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 15 ms 2396 KB Output is correct
42 Correct 15 ms 2396 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 1 ms 2440 KB Output is correct
45 Correct 84 ms 11348 KB Output is correct
46 Correct 143 ms 11344 KB Output is correct
47 Correct 69 ms 11344 KB Output is correct
48 Correct 149 ms 11400 KB Output is correct
49 Correct 75 ms 11344 KB Output is correct
50 Correct 74 ms 7620 KB Output is correct
51 Correct 59 ms 8628 KB Output is correct
52 Correct 44 ms 11276 KB Output is correct
53 Correct 44 ms 11352 KB Output is correct
54 Correct 18 ms 6748 KB Output is correct
55 Correct 20 ms 8028 KB Output is correct
56 Correct 19 ms 8016 KB Output is correct
57 Correct 52 ms 12628 KB Output is correct
58 Correct 46 ms 12532 KB Output is correct
59 Correct 48 ms 12884 KB Output is correct
60 Correct 47 ms 12624 KB Output is correct
61 Correct 50 ms 12624 KB Output is correct
62 Correct 20 ms 8040 KB Output is correct
63 Correct 21 ms 8060 KB Output is correct
64 Correct 20 ms 7920 KB Output is correct
65 Correct 20 ms 8028 KB Output is correct
66 Correct 22 ms 8044 KB Output is correct
67 Execution timed out 6019 ms 10900 KB Time limit exceeded
68 Halted 0 ms 0 KB -