제출 #238595

#제출 시각아이디문제언어결과실행 시간메모리
238595rahul_a_nDetecting Molecules (IOI16_molecules)C++14
100 / 100
67 ms6256 KiB
#include<bits/stdc++.h> #include "molecules.h" using namespace std; #define ll long long int #define pb(x) push_back(x) #define PI pair<int,int> #define PL pair<long int,long int> #define PLL pair<ll,ll> #define Tcase int t;cin>>t;while(t--) #define MOD 1000000007 #define all(x) x.begin(),x.end() #define MAXN 200005 #define F first #define S second vector<int> find_subset(int l,int r,vector<int> a){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n=(int)a.size(); vector<pair<int,int> >v; vector<int>ans; for(int i=0;i<n;i++) v.pb(make_pair(a[i],i)); sort(all(v)); ll curr=0;int L=0,R=-1; while(L<n && R<n){ if(curr>r){ curr-=v[L].F;L++; } else if(curr<l){ R++; curr+=v[R].F; } else{ for(int i=L;i<=R;i++) ans.pb(v[i].S); return ans; } } }

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:39:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#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...