Submission #1247707

#	Time	Username	Problem	Language	Result	Execution time	Memory
1247707		sean503	Brunhilda’s Birthday (BOI13_brunhilda)	C++20	4.76 / 100	1105 ms	247932 KiB

brunhilda

#include<iostream>
#include<vector>
#include<cstdlib> 
#include<string>
#include<algorithm>
#include<set>
#include<math.h>
#include<map>
#include<deque>
#include<unordered_map>
#include<iomanip>
#include<queue>
#include<array>
#include<climits>
#include<cstring>
#include<unordered_set>
#include<cstdint>
#include<typeinfo>
#include <random>
using namespace std;
#define int long long
const int MAX = 1e7+1;
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n,m;
    cin>>n>>m;
    vector<int> v(MAX,0);
    set<pair<int,int>> s;
    int biggest = 0;
    for(int i = 0; i<n; i++){
        int x;
        cin>>x;
        biggest = max(biggest,x);
        int temp = x;
        while(temp < MAX){
            if(s.size() != 0){
                pair<int,int> idk = *s.rbegin();
                if(temp > idk.first){
                    s.insert({temp,x});
                    continue;
                }
                pair<int,int> it = *s.upper_bound({temp,-1});
                if(it.first == temp && it.second < x){
                    s.erase(it);
                }else if(it.first == temp && it.second > x){
                    continue;
                }
            }
            s.insert({temp,x});
            temp += x;
        }
    }
    multiset<int> ms;
    priority_queue<pair<int,int>,vector<pair<int,int>>, greater<pair<int,int>>> pq;
    for(int i = 0; i<biggest; i++){
        v[i] = 1;
    }
    for(pair<int,int> i:s){
        int x = i.first;
        int y = i.second + i.first;
        while(!pq.empty() && pq.top().first <= x){

            ms.erase(ms.find(pq.top().second));
            pq.pop();
        }
        if(x < biggest){
            v[x] = 1;
        }else if(ms.size() == 0){
            v[x] = -1;
        }else{
            v[x] = *ms.begin() + 1;
        }
        ms.insert(v[x]);
        pq.push({y,v[x]});
    }
    for(int i = biggest; i<MAX; i++){
        if(v[i] == 0){
            v[i] = v[i-1];
        }
    }
    for(int i = 0; i<m; i++){
        int x;
        cin>>x;
        if(v[x] == -1){
            cout<<"oo"<<"\n";
            continue;
        }
        cout<<v[x]<<"\n";
    }
}

• Subtask 1: 3.3333 / 20
• Subtask 2: 0 / 20
• Subtask 3: 1.4286 / 60