제출 #1095877

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1095877		owoovo	통행료 (IOI18_highway)	C++17	6 / 100	73 ms	2208 KiB

highway

#include "highway.h"
#include<bits/stdc++.h>
#define ll long long
#define F first 
#define S second 
using namespace std;
vector<int>w;
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
  int M = U.size();
  w.resize(M);
  for(auto x:w)x=0;
  ll now=ask(w);
  int l=0,r=M+1;
  while(l<r-1){
    int m=(l+r)>>1;
    for(int i=0;i<M;i++)w[i]=0;
    for(int i=0;i<m;i++){
      w[i]=1;
    }
    ll ne=ask(w);
    if(ne!=now){
      r=m;
    }else{
      l=m;
    }
  }
  int L=-1,R=M;
  while(L<R-1){
    int m=(L+R)>>1;
    for(int i=0;i<M;i++)w[i]=0;
    for(int i=M-1;i>=m;i--){
      w[i]=1;
    }
    ll ne=ask(w);
    if(ne!=now){
      L=m;
    }else{
      R=m;
    }
  }
  //cout<<l<<" "<<R<<"\n";
  answer(l,R);
  return ;
}

컴파일 시 표준 에러 (stderr) 메시지

highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:11:12: warning: variable 'x' set but not used [-Wunused-but-set-variable]
   11 |   for(auto x:w)x=0;
      |            ^

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