제출 #206897

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
206897		MvC	Brunhilda’s Birthday (BOI13_brunhilda)	C++11	17.78 / 100	1101 ms	134352 KiB

brunhilda

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e6+50;
const int mod=1e9+7;
using namespace std;
int n,q,f[nmax],pr[nmax],x,i,j;
bitset<nmax>viz;
set<pair<int,int> >s;
set<pair<int,int> >::iterator it;
vector<int>d[nmax];
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>q;
	for(i=1;i<=n;i++)
	{
		cin>>x;
		for(j=x;j<=1e6;j+=x)d[j].pb(x);
		s.in(mkp(pr[x],x));
	}
	for(i=1;i<=1e6;i++)
	{
		f[i]=inf;
		for(j=0;j<(int)d[i].size();j++)viz[d[i][j]]=1;
		for(it=s.begin();it!=s.end();it++)
		{
			if(viz[it->sc])continue;
			f[i]=it->fr+1;
			break;
		}
		for(j=0;j<(int)d[i].size();j++)
		{
			viz[d[i][j]]=0;
			s.er(s.fd(mkp(pr[d[i][j]],d[i][j])));
			pr[d[i][j]]=f[i];
			s.in(mkp(pr[d[i][j]],d[i][j]));
		}
	}
	while(q--)
	{
		cin>>x;
		if(f[x]==inf)cout<<"oo\n";
		else cout<<f[x]<<'\n';
	}
	return 0;
}

• Subtask 1: 17.77777777777778 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 60