Submission #231601

#	Time	Username	Problem	Language	Result	Execution time	Memory
231601		Theo830	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	297 ms	32248 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
typedef long long ll;
ll INF = 1e18+7;
long long MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(long long i = a;i < b;i++)
#define rf(i,a,b) for(long long i=a;i>=b;i--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define w(t) while(t--)
#define c(n); cin>>n;
#define p(n) cout<<n;
#define pl(n) cout<<n<<endl;
#define ps(n); cout<<n<<" ";
#define F first
#define S second
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
#define ull unsigned long long
#define vll vector<ll>
#define vii vector<ii>
#define mkp make_pair
#define ld long double
#define arrin(a,n) f(i,0,n){cin>>a[i];}
#define arrout(a,n) f(i,0,n){cout<<a[i]<<" ";}
#define printclock cerr<<"Time : "<<1000*(ld)clock()/(ld)CLOCKS_PER_SEC<<"ms\n";
#define PI (2*acos(0))
const long long N = 1e6+5;
vll visit,dist,taken;
vector<vll> adj;
vector<vii> adj2;
priority_queue<ii,vector<ii>, greater<ii> > pq;
ll bit[N][2];
ll siz;
ll res = 0;
ll lcm(ll a,ll b){return (a * b) / __gcd(a,b);}
ll gcd(ll a,ll b){return __gcd(a,b);}
long long power(long long a,long long b){if(b == 0)return 1;if(b == 1)return a;long long ans = power(a,b/2) % MOD;ans *= ans;ans %= MOD;if(b % 2 == 1)ans *= a;return ans%MOD;}
ll inverse(ll x){x%=MOD;return power(x,MOD-2);}
void BITup(ll k, ll x,ll pos){while(k <= siz){bit[k][pos]+=x;k += k & -k;}}
ll BITq(ll k,ll pos){ll s=0;while(k>=1){s+=bit[k][pos];k -= k &-k;}return s;}
struct node{ll lazy,val;}seg[4000000];
struct point{ll x,y;};
void dfs(ll v){visit[v] = 1;for(auto x:adj[v]){if(!visit[x])dfs(x);}}
void bfs(ll s){visit[s] = 1;queue<ll>q;q.push(s);while(!q.empty()){ll u = q.front();ps(u);q.pop();for(auto x:adj[u]){if(!visit[x]){visit[x] = 1;q.push(x);}}}}
void dijkstra(ll s){pq.push(ii(0,s));dist[s] = 0;while(!pq.empty()){ii f = pq.top();pq.pop();ll w = f.F;ll u = f.S;if(w > dist[u]){continue;}for(auto v:adj2[u]){if(dist[u] + v.S < dist[v.F]){dist[v.F] = dist[u] + v.S;pq.push(ii(dist[v.F],v.F));}}}}
void prim(ll edge) {taken[edge] = 1;for(auto v:adj2[edge]) {if (taken[v.first]==0)pq.push(ii(v.second, v.first));}}
ll mst(ll s){taken.assign(N, 0);prim(s);ll cost = 0;while(!pq.empty()){ii front = pq.top();pq.pop();ll w = front.first;ll u = front.second;if(taken[u]==0)cost += w;prim(u);}return cost;}
void YESNO(ll a){if(!!a){pl("YES");}else{pl("NO");}}
void filesin(void){freopen("tracing.in","r",stdin);}
void filesout(void){freopen("tracing.out","w",stdout);}
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Training
vector<int> find_subset(int l, int u, vector<int> w){
    ll n = w.size();
    if(n == 1 && u <= 1000){
        ll dp[n+1][u+1];
        f(i,0,n+1){
            f(j,0,u+1){
                if(i == 0 || j == 0){
                    dp[i][j] = 0;
                }
                else if(j >= w[i-1]){
                    dp[i][j] = max(dp[i-1][j],dp[i-1][j-w[i-1]] + w[i-1]);
                }
                else{
                    dp[i][j] = dp[i-1][j];
                }
            }
        }
        vector<int>ans;
        ans.clear();
        if(dp[n][u] < l){
            return ans;
        }
        ll i = n,j = u;
        while(i * j > 0){
            if(dp[i][j] == dp[i-1][j]){
                i--;
            }
            else{
                i--;
                ans.pb(i);
                j -= w[i];
            }
        }
        sort(all(ans));
        return ans;
    }
    else{
        map<ll,set<int> >mp;
        f(i,0,n){
            mp[w[i]].insert(i);
        }
        multiset<ll>ans;
        vector<int>r;
        sort(all(w));
        ll sum = 0;
        f(i,0,n){
            ans.insert(w[i]);
            sum += w[i];
            multiset<ll>erased;
            for(auto x:ans){
                if(u-l < w[i] - x){
                    sum -= x;
                    erased.insert(x);
                }
                else{
                    break;
                }
            }
            for(auto x:erased){
                ans.erase(ans.find(x));
            }
            while(sum > u){
                for(auto x:ans){
                    sum -= x;
                    ans.erase(ans.find(x));
                    break;
                }
            }
            if(l <= sum && sum <= u){
                break;
            }
        }
        if(l > sum || sum > u){
            return r;
        }
        ll mini = INF,maxi = 0;
        for(auto x:ans){
            mini = min(x,mini);
            maxi = max(maxi,x);
        }
        if(maxi - mini > u-l){
            return r;
        }
        for(auto x:ans){
            for(auto y:mp[x]){
                r.pb(y);
                mp[x].erase(y);
                break;
            }
        }
        sort(all(r));
        return r;
    }
}

Compilation message (stderr)

molecules.cpp: In function 'void filesin()':
molecules.cpp:52:27: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void filesin(void){freopen("tracing.in","r",stdin);}
                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
molecules.cpp: In function 'void filesout()':
molecules.cpp:53:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void filesout(void){freopen("tracing.out","w",stdout);}
                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

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