oj.uz

Submission #311936

# Submission time Handle Problem Language Result Execution time Memory
311936 2020-10-12T03:29:38 Z VROOM_VARUN Port Facility (JOI17_port_facility) C++14
100 / 100
 1853 ms 85532 KB 
/*
ID: varunra2
LANG: C++
TASK: ports
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions
int n;
VII vals;
VI par;
VI siz;
MPII mp;

void init() {
  par.resize(2 * n);
  siz.assign(2 * n, 1);
  vals.resize(n);
  iota(all(par), 0);
}

int find(int x) {
  while (par[x] != par[par[x]]) par[x] = par[par[x]];
  return par[x];
}

bool same(int x, int y) { return find(x) == find(y); }

bool merge(int x, int y) {
  x = find(x);
  y = find(y);
  if (x == y) return false;
  if (siz[x] < siz[y]) swap(x, y);
  par[y] = x;
  siz[x] += siz[y];
  return true;
}

int main() {
// #ifndef ONLINE_JUDGE
  // freopen("ports.in", "r", stdin);
  // freopen("ports.out", "w", stdout);
// #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  cin >> n;
  init();

  for (int i = 0; i < n; i++) {
    cin >> vals[i].x >> vals[i].y;
  }

  sort(all(vals));

  for (int i = 0; i < n; i++) {
    auto start = mp.lower_bound(vals[i].x);
    auto end = mp.lower_bound(vals[i].y);
    while (start != end) {
      merge(i, start->y + n);
      merge(i + n, start->y);
      if (same(start->y, prev(end)->y)) break;  // this line is important
      // it keeps it from becoming O(n ^ 2)
      start++;
    }
    mp[vals[i].y] = i;
  }

  for (int i = 0; i < n; i++) {
    if (same(i, i + n)) {
      cout << "0\n";
      return 0;
    }
  }

  ll ret = 1;

  for (int i = 0; i < n; i++) {
    if (find(i) == i) {
      ret *= 2;
      ret %= MOD;
    }
  }

  cout << ret << '\n';

  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 2 ms 512 KB Output is correct
34 Correct 2 ms 512 KB Output is correct
35 Correct 1 ms 512 KB Output is correct
36 Correct 1 ms 512 KB Output is correct
37 Correct 4 ms 512 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 1 ms 512 KB Output is correct
40 Correct 2 ms 512 KB Output is correct
41 Correct 2 ms 512 KB Output is correct
42 Correct 2 ms 512 KB Output is correct
43 Correct 1 ms 512 KB Output is correct
44 Correct 2 ms 512 KB Output is correct
45 Correct 93 ms 8696 KB Output is correct
46 Correct 75 ms 8696 KB Output is correct
47 Correct 77 ms 8628 KB Output is correct
48 Correct 117 ms 8696 KB Output is correct
49 Correct 106 ms 8712 KB Output is correct
50 Correct 85 ms 8696 KB Output is correct
51 Correct 78 ms 8696 KB Output is correct
52 Correct 71 ms 8696 KB Output is correct
53 Correct 70 ms 8696 KB Output is correct
54 Correct 68 ms 8696 KB Output is correct
55 Correct 68 ms 8696 KB Output is correct
56 Correct 71 ms 8636 KB Output is correct
57 Correct 97 ms 8696 KB Output is correct
58 Correct 66 ms 8600 KB Output is correct
59 Correct 67 ms 8696 KB Output is correct
60 Correct 72 ms 8696 KB Output is correct
61 Correct 73 ms 8640 KB Output is correct
62 Correct 69 ms 8644 KB Output is correct
63 Correct 69 ms 8824 KB Output is correct
64 Correct 71 ms 8696 KB Output is correct
65 Correct 108 ms 8696 KB Output is correct
66 Correct 99 ms 8696 KB Output is correct
67 Correct 96 ms 8696 KB Output is correct
68 Correct 77 ms 8696 KB Output is correct
69 Correct 78 ms 8696 KB Output is correct
70 Correct 73 ms 8696 KB Output is correct
71 Correct 77 ms 8728 KB Output is correct
72 Correct 78 ms 8696 KB Output is correct
73 Correct 84 ms 8824 KB Output is correct
74 Correct 79 ms 8696 KB Output is correct
75 Correct 87 ms 8800 KB Output is correct
76 Correct 72 ms 8696 KB Output is correct
77 Correct 71 ms 8700 KB Output is correct
78 Correct 77 ms 8656 KB Output is correct
79 Correct 94 ms 8696 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 2 ms 512 KB Output is correct
34 Correct 2 ms 512 KB Output is correct
35 Correct 1 ms 512 KB Output is correct
36 Correct 1 ms 512 KB Output is correct
37 Correct 4 ms 512 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 1 ms 512 KB Output is correct
40 Correct 2 ms 512 KB Output is correct
41 Correct 2 ms 512 KB Output is correct
42 Correct 2 ms 512 KB Output is correct
43 Correct 1 ms 512 KB Output is correct
44 Correct 2 ms 512 KB Output is correct
45 Correct 93 ms 8696 KB Output is correct
46 Correct 75 ms 8696 KB Output is correct
47 Correct 77 ms 8628 KB Output is correct
48 Correct 117 ms 8696 KB Output is correct
49 Correct 106 ms 8712 KB Output is correct
50 Correct 85 ms 8696 KB Output is correct
51 Correct 78 ms 8696 KB Output is correct
52 Correct 71 ms 8696 KB Output is correct
53 Correct 70 ms 8696 KB Output is correct
54 Correct 68 ms 8696 KB Output is correct
55 Correct 68 ms 8696 KB Output is correct
56 Correct 71 ms 8636 KB Output is correct
57 Correct 97 ms 8696 KB Output is correct
58 Correct 66 ms 8600 KB Output is correct
59 Correct 67 ms 8696 KB Output is correct
60 Correct 72 ms 8696 KB Output is correct
61 Correct 73 ms 8640 KB Output is correct
62 Correct 69 ms 8644 KB Output is correct
63 Correct 69 ms 8824 KB Output is correct
64 Correct 71 ms 8696 KB Output is correct
65 Correct 108 ms 8696 KB Output is correct
66 Correct 99 ms 8696 KB Output is correct
67 Correct 96 ms 8696 KB Output is correct
68 Correct 77 ms 8696 KB Output is correct
69 Correct 78 ms 8696 KB Output is correct
70 Correct 73 ms 8696 KB Output is correct
71 Correct 77 ms 8728 KB Output is correct
72 Correct 78 ms 8696 KB Output is correct
73 Correct 84 ms 8824 KB Output is correct
74 Correct 79 ms 8696 KB Output is correct
75 Correct 87 ms 8800 KB Output is correct
76 Correct 72 ms 8696 KB Output is correct
77 Correct 71 ms 8700 KB Output is correct
78 Correct 77 ms 8656 KB Output is correct
79 Correct 94 ms 8696 KB Output is correct
80 Correct 780 ms 85328 KB Output is correct
81 Correct 780 ms 85476 KB Output is correct
82 Correct 863 ms 85320 KB Output is correct
83 Correct 788 ms 85368 KB Output is correct
84 Correct 780 ms 85340 KB Output is correct
85 Correct 800 ms 85368 KB Output is correct
86 Correct 783 ms 85348 KB Output is correct
87 Correct 861 ms 85368 KB Output is correct
88 Correct 878 ms 85456 KB Output is correct
89 Correct 803 ms 85332 KB Output is correct
90 Correct 830 ms 85460 KB Output is correct
91 Correct 826 ms 85384 KB Output is correct
92 Correct 904 ms 85432 KB Output is correct
93 Correct 890 ms 85416 KB Output is correct
94 Correct 793 ms 85364 KB Output is correct
95 Correct 790 ms 85496 KB Output is correct
96 Correct 825 ms 85368 KB Output is correct
97 Correct 717 ms 85328 KB Output is correct
98 Correct 838 ms 85336 KB Output is correct
99 Correct 819 ms 85344 KB Output is correct
100 Correct 1794 ms 85376 KB Output is correct
101 Correct 1853 ms 85452 KB Output is correct
102 Correct 889 ms 85368 KB Output is correct
103 Correct 925 ms 85348 KB Output is correct
104 Correct 959 ms 85424 KB Output is correct
105 Correct 918 ms 85368 KB Output is correct
106 Correct 946 ms 85424 KB Output is correct
107 Correct 948 ms 85384 KB Output is correct
108 Correct 1002 ms 85340 KB Output is correct
109 Correct 986 ms 85432 KB Output is correct
110 Correct 1050 ms 85344 KB Output is correct
111 Correct 873 ms 85368 KB Output is correct
112 Correct 876 ms 85532 KB Output is correct
113 Correct 781 ms 85456 KB Output is correct
114 Correct 783 ms 85420 KB Output is correct