제출 #722275

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
722275		PoPularPlusPlus	Brunhilda’s Birthday (BOI13_brunhilda)	C++17	100 / 100	392 ms	44824 KiB

brunhilda

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

bool remender(ll a , ll b){return a%b;}

//freopen("problemname.in", "r", stdin);
//freopen("problemname.out", "w", stdout);

const int N = 10000002;
int ans[N];

void solve(){
	int n , qu;
	cin >> n >> qu;
	int arr[n];
	for(int i = 0; i < n; i++)cin >> arr[i];
	set<pair<int,int>> q;
	for(int i = 0; i < n; i++){
		q.insert(mp(0,i));
	}
	for(int i = 1; i <= N-2; i++){
		while(q.size()){
			pair<int,int> p = *q.begin();
			if(p.vf + arr[p.vs] <= i){
				int mul = i/arr[p.vs];
				q.insert(mp(mul*arr[p.vs] , p.vs));
				q.erase(q.begin());
			}
			else break;
		}
		ans[i] = 1e9;
		ans[i] = ans[(*q.begin()).vf] + 1;
	}
	while(qu--){
		int x;
		cin >> x;
		if(ans[x] >= 1e9)cout << "oo\n";
		else cout << ans[x] << '\n';
	}
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
   // int t;cin>>t;
   // while(t--){
		solve();
	//}
	return 0;
}

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