oj.uz

답안 #915048

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
915048 2024-01-23T08:46:21 Z duckindog 자매 도시 (APIO20_swap) C++14
0 / 100
 2000 ms 14948 KB 
#include "swap.h"

#include<bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10,
          M = 1e3 + 10;
int n, m;
vector<pair<int, int>> ad[N];

vector<int> co;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
  n = N; m = M;
  for (int i = 0; i < m; ++i) {
    int u = U[i], v = V[i], w = W[i];
    co.push_back(w);
    ad[u].push_back({v, w});
    ad[v].push_back({u, w});

  }
  sort(co.begin(), co.end());
  co.resize(unique(co.begin(), co.end()) - co.begin());

}


bool dd[N];
int special;
bool dfs1(int u, int pre, int cw) {
  if (u == special) return 1;
  bool ret = 0;
  for (auto duck : ad[u]) {
    int v, w; tie(v, w) = duck;
    if (v == pre || w > cw) continue;
    if (!dd[v]) {
      dd[v] = 1;
      ret |= dfs1(v, u, cw);
    }
  }
  return ret;
}

bool dfs2(int u, int pre, int cw) {
  int cnt = bool(pre);
  bool ret = 0;
  for (auto duck : ad[u]) {
    int v, w; tie(v, w) = duck;
    if (v == pre || w > cw) continue;
    if (dd[v]) return 1;
    dd[v] = 1;
    cnt += 1;
    ret |= dfs2(v, u, cw);
  }
  return (cnt > 2 || ret);
}

int getMinimumFuelCapacity(int X, int Y) {

  int l = 0, r = co.size() - 1;
  int answer = -1;
  special = Y;
  while (l <= r) {
    int mid = l + r >> 1;

    bool ret = 1;
    memset(dd, 0, sizeof dd); ret &= dfs1(X, 0, co[mid]);
    memset(dd, 0, sizeof dd); ret &= dfs2(X, 0, co[mid]);

    if (ret) r = mid - 1, answer = co[mid];
    else l = mid + 1;
  }
  return answer;

}

Compilation message

swap.cpp: In function 'int getMinimumFuelCapacity(int, int)':
swap.cpp:64:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   64 |     int mid = l + r >> 1;
      |               ~~^~~

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2904 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 2 ms 2820 KB Output is correct
7 Correct 2 ms 3160 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 65 ms 12532 KB Output is correct
10 Correct 99 ms 13920 KB Output is correct
11 Correct 162 ms 14476 KB Output is correct
12 Correct 147 ms 14132 KB Output is correct
13 Correct 355 ms 14948 KB Output is correct
14 Execution timed out 2044 ms 12724 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Execution timed out 2013 ms 10560 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2904 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 2 ms 2820 KB Output is correct
7 Correct 2 ms 3160 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 2 ms 2904 KB Output is correct
12 Correct 2 ms 2808 KB Output is correct
13 Correct 2 ms 2812 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct
16 Correct 2 ms 2908 KB Output is correct
17 Correct 2 ms 2908 KB Output is correct
18 Correct 2 ms 2908 KB Output is correct
19 Correct 2 ms 2804 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Incorrect 3 ms 2808 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2904 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 2 ms 2820 KB Output is correct
8 Correct 2 ms 3160 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 65 ms 12532 KB Output is correct
11 Correct 99 ms 13920 KB Output is correct
12 Correct 162 ms 14476 KB Output is correct
13 Correct 147 ms 14132 KB Output is correct
14 Correct 355 ms 14948 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct
16 Correct 2 ms 2904 KB Output is correct
17 Correct 2 ms 2808 KB Output is correct
18 Correct 2 ms 2812 KB Output is correct
19 Correct 2 ms 2908 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 2 ms 2908 KB Output is correct
23 Correct 2 ms 2908 KB Output is correct
24 Correct 2 ms 2804 KB Output is correct
25 Correct 2 ms 2908 KB Output is correct
26 Correct 2 ms 2908 KB Output is correct
27 Incorrect 3 ms 2808 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2904 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 2 ms 2820 KB Output is correct
7 Correct 2 ms 3160 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 65 ms 12532 KB Output is correct
10 Correct 99 ms 13920 KB Output is correct
11 Correct 162 ms 14476 KB Output is correct
12 Correct 147 ms 14132 KB Output is correct
13 Correct 355 ms 14948 KB Output is correct
14 Execution timed out 2044 ms 12724 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2904 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 2 ms 2820 KB Output is correct
8 Correct 2 ms 3160 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 65 ms 12532 KB Output is correct
11 Correct 99 ms 13920 KB Output is correct
12 Correct 162 ms 14476 KB Output is correct
13 Correct 147 ms 14132 KB Output is correct
14 Correct 355 ms 14948 KB Output is correct
15 Execution timed out 2044 ms 12724 KB Time limit exceeded
16 Halted 0 ms 0 KB -