oj.uz

답안 #1039643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1039643 2024-07-31T06:46:08 Z vjudge1 통행료 (IOI18_highway) C++17
51 / 100
 118 ms 13356 KB 
#include "highway.h"
#include<bits/stdc++.h>
#define K 1<<17
using namespace std;
int bfspos[2][K],CC,bfspar[2][K],bfspari[2][K],bfsdis[2][K];
vector<pair<int,int>>adj[K];
void bfs(int n,int i){
    queue<int>q;
    int CC=0;
    memset(bfsdis[i],-1,sizeof *bfspos);
    q.push(n);
    bfsdis[i][n]=0;
    bfspar[i][n]=-1;
    while(q.size()){
        int x=q.front(),d=bfsdis[i][x];
        q.pop(); bfspos[i][x]=++CC;
        for(auto [j,k]:adj[x]) if(bfsdis[i][j]<0)
            bfspar[i][j]=x,bfspari[i][j]=k,
            bfsdis[i][j]=d+1,q.push(j);
    }
}
int indd;
int whicho(int pivot,int N,int ind,int M,vector<int>v,long long D,int spec){
    indd=ind;
    sort(v.begin(),v.end(),[](int a,int b){
        return bfspos[indd][a]<bfspos[indd][b];
    });
    int l=1,r=v.size()-1,res=1;
    while(l<=r){
        int mid=l+r>>1;
        vector<int>V(M,1);
        V[spec]=0;
        for(int i=mid;i<v.size();i++) {
            if(bfspar[ind][v[i]]!=pivot)
                if(!V[bfspari[ind][bfspar[ind][v[i]]]])
                    continue;
            V[bfspari[ind][v[i]]]=0;
        }
        if(ask(V)<D)
            l=res=mid+1;
        else r=mid-1;
    }
    return v[res-1];
}
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
    int 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});
    long long D=ask(vector<int>(M,0))/A;
    int res=1e9,l=1,r=M-1;
    while(l<=r){
        int mid=l+r>>1;
        vector<int>v(M);
        for(int i=0;i<mid;i++)
            v[i]=1;
        if(ask(v)>D*A)
            res=r=mid-1;
        else l=mid+1;
    }
    int a=U[res],b=V[res];
    bfs(a,0);
    bfs(b,1);
    vector<int>sta,stb;
    for(int i=0;i<N;i++)
        if(bfsdis[0][i]<bfsdis[1][i])
            sta.push_back(i);
        else if(bfsdis[0][i]-bfsdis[1][i])
            stb.push_back(i);
    answer(whicho(a,N,0,M,sta,D*B-B+A,res),
            whicho(b,N,1,M,stb,D*B-B+A,res));
}

Compilation message

highway.cpp: In function 'int whicho(int, int, int, int, std::vector<int>, long long int, int)':
highway.cpp:30:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   30 |         int mid=l+r>>1;
      |                 ~^~
highway.cpp:33:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         for(int i=mid;i<v.size();i++) {
      |                       ~^~~~~~~~~
highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:53:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   53 |         int mid=l+r>>1;
      |                 ~^~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 10 ms 5464 KB Output is correct
3 Correct 103 ms 12548 KB Output is correct
4 Correct 109 ms 12560 KB Output is correct
5 Correct 96 ms 12564 KB Output is correct
6 Correct 86 ms 12548 KB Output is correct
7 Correct 93 ms 12556 KB Output is correct
8 Correct 108 ms 12540 KB Output is correct
9 Correct 95 ms 12560 KB Output is correct
10 Correct 93 ms 12568 KB Output is correct
11 Correct 104 ms 12320 KB Output is correct
12 Correct 96 ms 12088 KB Output is correct
13 Correct 98 ms 11976 KB Output is correct
14 Correct 94 ms 11988 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 5208 KB Output is correct
2 Correct 18 ms 6280 KB Output is correct
3 Correct 25 ms 6944 KB Output is correct
4 Correct 74 ms 12200 KB Output is correct
5 Correct 70 ms 12012 KB Output is correct
6 Correct 73 ms 12088 KB Output is correct
7 Correct 83 ms 11996 KB Output is correct
8 Correct 73 ms 12144 KB Output is correct
9 Correct 75 ms 12040 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 13 ms 5384 KB Output is correct
3 Correct 70 ms 10776 KB Output is correct
4 Correct 91 ms 12540 KB Output is correct
5 Correct 95 ms 12564 KB Output is correct
6 Correct 92 ms 12560 KB Output is correct
7 Correct 89 ms 12552 KB Output is correct
8 Correct 91 ms 12536 KB Output is correct
9 Correct 105 ms 12544 KB Output is correct
10 Correct 99 ms 12560 KB Output is correct
11 Correct 95 ms 11968 KB Output is correct
12 Correct 109 ms 12016 KB Output is correct
13 Correct 93 ms 12072 KB Output is correct
14 Correct 102 ms 12296 KB Output is correct
15 Correct 98 ms 12560 KB Output is correct
16 Correct 93 ms 12552 KB Output is correct
17 Correct 90 ms 12232 KB Output is correct
18 Correct 94 ms 11984 KB Output is correct
19 Correct 102 ms 12564 KB Output is correct
20 Correct 100 ms 11980 KB Output is correct
21 Correct 75 ms 13272 KB Output is correct
22 Correct 77 ms 13288 KB Output is correct
23 Correct 94 ms 13008 KB Output is correct
24 Correct 87 ms 12788 KB Output is correct
25 Correct 99 ms 12556 KB Output is correct

Subtask #5
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 5512 KB Output is correct
2 Correct 12 ms 5464 KB Output is correct
3 Correct 99 ms 13096 KB Output is correct
4 Incorrect 118 ms 13356 KB Output is incorrect: {s, t} is wrong.
5 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

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