Submission #671369

#	Time	Username	Problem	Language	Result	Execution time	Memory
671369		coding_snorlax	커다란 상품 (IOI17_prize)	C++14	Compilation error	0 ms	0 KiB

prize

#include<bits/stdc++.h>
#include "prize.h"
using namespace std;
int N;
int Total=0;
int answer;
vector<int> ask(int n){
    vector<int> answer;
    int tmp1,tmp2;
    cout<<"n: "<<n<<"\n";
    cin>>tmp1>>tmp2;
    answer.push_back(tmp1);
    answer.push_back(tmp2);
    return answer;
}
void recurtion(int left,int left_ans,int right,int right_ans,int split_answer){
    //cout<<left<<" "<<left_ans<<" "<<right<<" "<<right_ans<<" "<<split_answer<<"\n";
    if(!split_answer) return;
    else{
        int M=(left+right)/2;
        for(int i=M;i>=left;i--){
            auto it = ask(i);
            if((it[0]+it[1])==Total){
                recurtion(left,left_ans,i,it[1],it[0]-left_ans);
                recurtion(M+1,it[0]+(M-i),right,right_ans,it[1]-right_ans-(M-i));
                return;
            }
            else if(it[0]==0 && it[1]==0){
                answer=i;
                return;
            }
        }
        for(int i=M+1;i<=right;i++){
            auto it = ask(i);
            if((it[0]+it[1])==Total){
                recurtion(i+1,it[0],right,right_ans,it[1]-right_ans);
                return;
            }
            else if(it[0]==0 && it[1]==0){
                answer=i;
                return;
            }
        }
    }
}

int find_best(int n){
    N=n;

    for(int i=1;i<=min(500,n-1);i++){
        auto it = ask(i);
        Total = max(Total, it[0] + it[1]);
    }
    /*
    for(int i=0;i<(n/1024)+1;i++){
        auto it = ask(i*1024);
        recurtion(i*1024,it,min(n,(i+1)*1024),)
    }*/
    recurtion(0, 0, n-1, 0, Total);
    return answer;
}

Compilation message (stderr)

/usr/bin/ld: /tmp/ccKBR0dK.o: in function `ask(int)':
grader.cpp:(.text+0x80): multiple definition of `ask(int)'; /tmp/cc0COQXK.o:prize.cpp:(.text+0x0): first defined here
collect2: error: ld returned 1 exit status