제출 #81068

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
81068		faustaadp	커다란 상품 (IOI17_prize)	C++17	20 / 100	141 ms	6604 KiB

prize

#include "prize.h"
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
int L,R,j,b[202020],C,nx,ma;
vector<int> d[202020];
int find_best(int n) {
    vector<pair<int,vector<int> > > v;
	for(int i = 0; i < n; i++)
    {
        L=i+1;
        R=n-1;
        vector<int> res;
        if(b[i]==1)res=d[i];
        else res=ask(i);
        b[i]=1;
        d[i]=res;
        ma=max(ma,res[0]+res[1]);
        if(res[0] + res[1] == 0)return i;
        if(res[0]+res[1]<ma)R=min(n-1,i+7);
        for(j=0;j<v.size();j++)
            if(v[j].se==res)
                L=max(v[j].fi+1,L);
        for(j=0;j<v.size();j++)
            if(v[j].se!=res&&v[j].fi>i)
            {
                R=min(R,v[j].fi);
                break;
            }
        nx=L;
        while(L<R)
        {
            C=(L+R)/2;
            vector<int> temp;
            if(b[C])temp=d[C];
            else    temp=ask(C);
            if(!b[C])
            v.pb(mp(C,temp));
            if(temp[0]+temp[1]==0)return C;
            b[C]=1;
            d[C]=temp;
            ma=max(ma,temp[0]+temp[1]);
            if(res[0]+res[1]<ma)break;
            if(temp==res)
            {
                nx=C;
                L=C+1;
            }
            else
                R=C-1;
        }
        sort(v.begin(),v.end());
        i=nx;
	}
	return 0;
}

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

prize.cpp: In function 'int find_best(int)':
prize.cpp:25:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(j=0;j<v.size();j++)
                 ~^~~~~~~~~
prize.cpp:28:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(j=0;j<v.size();j++)
                 ~^~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 0 / 80