제출 #641291

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
641291		knon0501	Finding Routers (IOI20_routers)	C++14	77.94 / 100	2 ms	724 KiB

routers

#include "routers.h"
#include <bits/stdc++.h>;
using namespace std;

int memo[100005];
std::vector<int> find_routers(int l, int n, int q) {
    vector<int> ans={0};
  
   // cout<<l<<" "<<n<<" "<<q<<endl;
    for(int i=1 ; i<n ; i++){
        int lef=ans[i-1]+1;
        int rig=l;
        int k;
     
        while ((rig>=lef))
        {
            int mid=lef+rig>>1;
            int x;
            if(memo[mid]){
                x=memo[mid];
            }
            else
                x=use_detector(mid);
             memo[mid]=x;
            if(x<=i-1){
                k=mid;
                lef=mid+1;
            }
            else{
                rig=mid-1;
            }
        
        }
       
        ans.push_back(2*k-ans[i-1]);
      //  cout<<i<<" "<<ans[i]<<"!\n";
    }    
	return ans;
}

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

routers.cpp:2:25: warning: extra tokens at end of #include directive
    2 | #include <bits/stdc++.h>;
      |                         ^
routers.cpp: In function 'std::vector<int> find_routers(int, int, int)':
routers.cpp:17:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   17 |             int mid=lef+rig>>1;
      |                     ~~~^~~~
routers.cpp:35:24: warning: 'k' may be used uninitialized in this function [-Wmaybe-uninitialized]
   35 |         ans.push_back(2*k-ans[i-1]);
      |                       ~^~

• Subtask 1: 16 / 16
• Subtask 2: 21 / 21
• Subtask 3: 23 / 23
• Subtask 4: 17.9392 / 40