제출 #1142322

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1142322	2025-01-29 16:41:39	byunjaewoo	통행료 (IOI18_highway)	C++20	51 / 100	125 ms	11800 KiB

highway

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "highway.h"
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=90010;
int n, m, p, u, v, ans1, ans2, d[N], is[N], it[N];
bool chk[N];
ll dist;
vector<int> vs, vt;
queue<int> q;
vector<pair<int, int>> adj[N];
void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
  n=N, m=U.size();
  for(int i=0; i<m; i++) adj[U[i]].push_back({V[i], i}), adj[V[i]].push_back({U[i], i});
  vector<int> tmp(m, 0);
  dist=ask(tmp)/A;
  for(int s=0, e=m-1; s<e; ) {
    int mid=(s+e)/2;
    vector<int> tmp(m, 0);
    for(int j=0; j<=mid; j++) tmp[j]=1;
    if(ask(tmp)==dist*A) p=s=mid+1;
    else e=mid;
  }
  u=U[p], v=V[p];
  fill(d, d+n, N), d[u]=d[v]=0, q.push(u), q.push(-v-1);
  while(!q.empty()) {
    int curr=q.front(); q.pop();
    if(curr<0) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 6 / 6
• Subtask 4: 33 / 33
• Subtask 5: 0 / 18
• Subtask 6: 0 / 31