oj.uz

답안 #866406

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
866406 2023-10-26T05:00:47 Z mgl_diamond Port Facility (JOI17_port_facility) C++17
22 / 100
 34 ms 20560 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 = 1e5+5;

int n, evts[N], st[N], en[N];
vector<int> graph[N];
int cnt;
bool vis[N];
int color[N];

void dfs(int u) {
  vis[u] = 1;
  fore(v, graph[u]) {
    if (!vis[v]) { color[v] = color[u]^1; dfs(v); }
    else if (color[v] == color[u]) {
      cout << 0;
      exit(0);
    }
  }
}

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

  foru(i, 1, n) {
    cin >> st[i] >> en[i];
    evts[st[i]] = i;
    evts[en[i]] = i;
  }

  foru(i, 1, n) 
    foru(j, 1, n)
      if (st[j] < st[i] && st[i] < en[j] && en[j] < en[i]) {
        graph[i].push_back(j);
        graph[j].push_back(i);
      }

  foru(i, 1, n) {
    if (vis[i]) continue;
    dfs(i);
    ++cnt;
  }

  int ans = 1;
  foru(i, 1, cnt) 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2908 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2904 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 3120 KB Output is correct
8 Correct 1 ms 3160 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2908 KB Output is correct
14 Correct 1 ms 2908 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 1 ms 2908 KB Output is correct
17 Correct 1 ms 2908 KB Output is correct
18 Correct 1 ms 2908 KB Output is correct
19 Correct 1 ms 2908 KB Output is correct
20 Correct 1 ms 2908 KB Output is correct
21 Correct 1 ms 2908 KB Output is correct
22 Correct 1 ms 2908 KB Output is correct
23 Correct 1 ms 2908 KB Output is correct
24 Correct 1 ms 2908 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2908 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2904 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 3120 KB Output is correct
8 Correct 1 ms 3160 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2908 KB Output is correct
14 Correct 1 ms 2908 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 1 ms 2908 KB Output is correct
17 Correct 1 ms 2908 KB Output is correct
18 Correct 1 ms 2908 KB Output is correct
19 Correct 1 ms 2908 KB Output is correct
20 Correct 1 ms 2908 KB Output is correct
21 Correct 1 ms 2908 KB Output is correct
22 Correct 1 ms 2908 KB Output is correct
23 Correct 1 ms 2908 KB Output is correct
24 Correct 1 ms 2908 KB Output is correct
25 Correct 21 ms 3420 KB Output is correct
26 Correct 22 ms 3412 KB Output is correct
27 Correct 24 ms 3412 KB Output is correct
28 Correct 23 ms 3572 KB Output is correct
29 Correct 22 ms 3420 KB Output is correct
30 Correct 22 ms 3676 KB Output is correct
31 Correct 22 ms 3420 KB Output is correct
32 Correct 22 ms 3412 KB Output is correct
33 Correct 22 ms 3676 KB Output is correct
34 Correct 22 ms 3416 KB Output is correct
35 Correct 18 ms 3160 KB Output is correct
36 Correct 18 ms 3164 KB Output is correct
37 Correct 33 ms 20560 KB Output is correct
38 Correct 34 ms 11860 KB Output is correct
39 Correct 18 ms 3160 KB Output is correct
40 Correct 18 ms 3164 KB Output is correct
41 Correct 30 ms 11364 KB Output is correct
42 Correct 31 ms 11164 KB Output is correct
43 Correct 19 ms 3164 KB Output is correct
44 Correct 18 ms 3244 KB Output is correct

Subtask #3
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2908 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2904 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 3120 KB Output is correct
8 Correct 1 ms 3160 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2908 KB Output is correct
14 Correct 1 ms 2908 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 1 ms 2908 KB Output is correct
17 Correct 1 ms 2908 KB Output is correct
18 Correct 1 ms 2908 KB Output is correct
19 Correct 1 ms 2908 KB Output is correct
20 Correct 1 ms 2908 KB Output is correct
21 Correct 1 ms 2908 KB Output is correct
22 Correct 1 ms 2908 KB Output is correct
23 Correct 1 ms 2908 KB Output is correct
24 Correct 1 ms 2908 KB Output is correct
25 Correct 21 ms 3420 KB Output is correct
26 Correct 22 ms 3412 KB Output is correct
27 Correct 24 ms 3412 KB Output is correct
28 Correct 23 ms 3572 KB Output is correct
29 Correct 22 ms 3420 KB Output is correct
30 Correct 22 ms 3676 KB Output is correct
31 Correct 22 ms 3420 KB Output is correct
32 Correct 22 ms 3412 KB Output is correct
33 Correct 22 ms 3676 KB Output is correct
34 Correct 22 ms 3416 KB Output is correct
35 Correct 18 ms 3160 KB Output is correct
36 Correct 18 ms 3164 KB Output is correct
37 Correct 33 ms 20560 KB Output is correct
38 Correct 34 ms 11860 KB Output is correct
39 Correct 18 ms 3160 KB Output is correct
40 Correct 18 ms 3164 KB Output is correct
41 Correct 30 ms 11364 KB Output is correct
42 Correct 31 ms 11164 KB Output is correct
43 Correct 19 ms 3164 KB Output is correct
44 Correct 18 ms 3244 KB Output is correct
45 Runtime error 4 ms 5976 KB Execution killed with signal 11
46 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2908 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2904 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 3120 KB Output is correct
8 Correct 1 ms 3160 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2908 KB Output is correct
14 Correct 1 ms 2908 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 1 ms 2908 KB Output is correct
17 Correct 1 ms 2908 KB Output is correct
18 Correct 1 ms 2908 KB Output is correct
19 Correct 1 ms 2908 KB Output is correct
20 Correct 1 ms 2908 KB Output is correct
21 Correct 1 ms 2908 KB Output is correct
22 Correct 1 ms 2908 KB Output is correct
23 Correct 1 ms 2908 KB Output is correct
24 Correct 1 ms 2908 KB Output is correct
25 Correct 21 ms 3420 KB Output is correct
26 Correct 22 ms 3412 KB Output is correct
27 Correct 24 ms 3412 KB Output is correct
28 Correct 23 ms 3572 KB Output is correct
29 Correct 22 ms 3420 KB Output is correct
30 Correct 22 ms 3676 KB Output is correct
31 Correct 22 ms 3420 KB Output is correct
32 Correct 22 ms 3412 KB Output is correct
33 Correct 22 ms 3676 KB Output is correct
34 Correct 22 ms 3416 KB Output is correct
35 Correct 18 ms 3160 KB Output is correct
36 Correct 18 ms 3164 KB Output is correct
37 Correct 33 ms 20560 KB Output is correct
38 Correct 34 ms 11860 KB Output is correct
39 Correct 18 ms 3160 KB Output is correct
40 Correct 18 ms 3164 KB Output is correct
41 Correct 30 ms 11364 KB Output is correct
42 Correct 31 ms 11164 KB Output is correct
43 Correct 19 ms 3164 KB Output is correct
44 Correct 18 ms 3244 KB Output is correct
45 Runtime error 4 ms 5976 KB Execution killed with signal 11
46 Halted 0 ms 0 KB -