제출 #1001798

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1001798		ayankarimova	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	252 ms	65536 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector<int>ans;
    map<ll, ll>mp;
    for(auto i:w)
        mp[i]++;
    for(auto i:mp){
        ll num=(l+i.first-1)/i.first;
        if(num<=i.second && num*i.first<=u){
            for(int j=1; j<=num; j++){
                ans.push_back(i.first);
            }
            break;
        }
        else if(num>i.second){
            if(mp[i.first+1]){
                ll cur=l-i.second*i.first;
                ll num1=(cur+(i.first+1)-1)/(i.first+1);
                if(num1<=mp[i.first+1] && i.second*i.first+num1*(i.first+1)<=u){
                    for(int j=1; j<=num; j++){
                        ans.push_back(i.first);
                    }
                    for(int j=1; j<=num1; j++){
                        ans.push_back(i.first+1);
                    }
                    break;
                }
            }
            if(mp[i.first-1]){
                ll cur=l-i.second*i.first;
                ll num1=(cur+(i.first-1)-1)/(i.first-1);
                if(num1<=mp[i.first-1] && i.second*i.first+num1*(i.first-1)<=u){
                    for(int j=1; j<=num; j++){
                        ans.push_back(i.first);
                    }
                    for(int j=1; j<=num1; j++){
                        ans.push_back(i.first-1);
                    }
                    break;
                }
            }
        }
    }
    return ans;
}
/*
{} []
*/

• Subtask 1: 0 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31