oj.uz

답안 #77296

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
77296 2018-09-24T20:01:44 Z toreto_back 통행료 (IOI18_highway) C++14
0 / 100
 19 ms 648 KB 
#include "highway.h"
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef double D;
const ll mod=1e9+7;
const ll inf=(1ll<<61);
const int MX=3e5+9;

vector<int>w;
int m;
void init(int x){
    for(int j=0;j<m;j++)w[j]=x;
}
void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
    int l=0,r=N-1,M=U.size(),n=N;
    int q=99;m=M;
    for(int i=0;i<m;i++)w.push_back(0);
    ll c=ask(w);
    int len=c/A;
    while(r-l+1>2*len && r-l+1-len+1>q){
        int mid=(l+r)/2;
        init(0);
        for(int i=l;i<mid;i++)w[i]=1;
        ll c1=ask(w);q--;
        if(c1==c){
            l=max(0,mid-len+1);
        }
        else r=min(mid+len-1,n-1);
    }
    init(1);
    for(int i=l;i<(l+r)/2;i++)w[i]=0;
    ll c1=ask(w);
    if(c1==c){
        l=(l+r)/2-1;
    }
    else{
        c=c1;
        ll d=len,a=A,b=B;
        ll xb=(c-d*a)/(b-a);
        ll xa=(c-(b*((c-d*a)/(b-a))))/a;
        xa=(l+r)/2 - xa;
        answer(xa,xa+len);
        return;
    }
    for(int i=l;i+len<=r;i++){
        init(1);
        for(int j=i;j<len+i;j++)w[j]=0;
        ll c1=ask(w);
        if(c1==c){
            answer(i,i+len);
            break;
        }
    }
}

Compilation message

highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:42:12: warning: unused variable 'xb' [-Wunused-variable]
         ll xb=(c-d*a)/(b-a);
            ^~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 7.0

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

Subtask #3
0 / 6.0

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

Subtask #4
0 / 33.0

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

Subtask #5
0 / 18.0

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

Subtask #6
0 / 31.0

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