oj.uz

답안 #1073807

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073807 2024-08-24T22:11:00 Z shezitt 통행료 (IOI18_highway) C++14
5 / 100
 12 ms 1368 KB 
#include "highway.h"
#include <bits/stdc++.h>

using ll = long long;
using namespace std;

#define pb push_back
#define sz(x) (int)x.size()

void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
  int M = U.size();
  
  vector<int> tmp(M, 0);

  vector<vector<pair<int,int>>> adj(N+1);
  for(int i=0; i<M; ++i){
    adj[U[i]].pb({V[i], i});
    adj[V[i]].pb({U[i], i});
  }

  ll W = ask(tmp);
  int aristas = W / A;
  
  vector<int> pa(N+1, -1);

  auto bfs = [&](int at) -> vector<int> {
    vector<int> res;
    vector<int> dis(N+1, N+10);
    
    queue<int> q;
    q.push(at);
    dis[at] = 0;
    while(sz(q)){
      int cur = q.front();
      q.pop();
      if(dis[cur] == aristas){
        res.pb(cur);
      }
      for(auto [u, id] : adj[cur]){
        if(dis[cur] + 1 < dis[u]){
          dis[u] = dis[cur] + 1;
          q.push(u);
          pa[u] = id;
        }
      }
    }
    return res;
  };

  vector<int> cands = bfs(0);

  int ans = 0;
  for(int x : cands){
    int ante = pa[x];
    tmp[ante] = 1;
    ll w = ask(tmp);
    if(w != W){
      ans = x;
      break;
    }
    tmp[ante] = 0;
  }
  
  answer(0, ans);

}

Compilation message

highway.cpp: In lambda function:
highway.cpp:39:16: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   39 |       for(auto [u, id] : adj[cur]){
      |                ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 12 ms 1352 KB Execution killed with signal 13
3 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 1112 KB Output is incorrect: {s, t} is wrong.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output is incorrect: {s, t} is wrong.
2 Halted 0 ms 0 KB -

Subtask #5
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 10 ms 1368 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 9 ms 1368 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -