제출 #1273073

#제출 시각아이디문제언어결과실행 시간메모리
1273073quanduongxuan12Detecting Molecules (IOI16_molecules)C++20
69 / 100
33 ms4120 KiB
#include <bits/stdc++.h> #include "molecules.h" using namespace std; #define name "molecules" #define MAXN 100005 #define pb push_back #define pf push_front #define ll long long #define ii pair<int, int> #define fs first #define sc second #define ill pair<int, ll> #define lli pair<ll, int> #define llll pair<ll, ll> #define all(v) v.begin(),v.end() #define uni(v) v.erase(unique(all(v)),v.end()) #define bit(n,i) (((n)>>(i))&1) #define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++) #define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--) #define MASK(i) (1LL<<(i)) const int INF=1e9; const int MOD=1e9+7; void add(int &u, int v){ u+=v; if (u>=MOD) u-=MOD; } void sub(int &u, int v){ u-=v; if (u<0) u+=MOD; } void minimize(int &u, int v){ u=min(u,v); } void maximize(int &u, int v){ u=max(u,v); } long long Rand(long long l, long long r){ ll tmp=0; FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand())); return l+tmp%(r-l+1); } /* int n,L,U; vector<int> a; */ vector<int> find_subset(int l, int u, vector<int> w){ vector<int> kq; vector<ii> pi; FOR(i,0,(int)w.size()-1){ pi.pb({w[i],i}); } sort(all(pi)); int j=0; int sum=0; FOR(i,0,(int)w.size()-1){ sum+=pi[i].fs; while (sum>u){ sum-=pi[j].fs; ++j; } if (sum>=l){ FOR(t,j,i){ kq.pb(pi[t].sc); } break; } } return kq; } /* int main() { freopen(name".inp","r",stdin); freopen(name".out","w",stdout); ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin>>n>>L>>U; FOR(i,0,n-1){ a.emplace_back(); cin>>a[i]; } vector<int> res=find_subset(L,U,a); for (int x:res) cout<<x<<" "; return 0; } */

컴파일 시 표준 에러 (stderr) 메시지

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...