제출 #754331

#제출 시각아이디문제언어결과실행 시간메모리
754331DJeniUpDetecting Molecules (IOI16_molecules)C++17
0 / 100
1 ms312 KiB
#include "molecules.h" #include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<ll,ll>pairll; #define fr first #define sc second #define pb push_back #define N 100007 priority_queue<pairll,vector<pairll>,greater<pairll> >q; priority_queue<pairll>g; struct D{ ll a,n; }d[2*N]; bool mcp(D d1, D d2){ return d1.a<d2.a; } std::vector<int> find_subset(int l, int u, std::vector<int> w) { for(int i=0;i<w.size();i++){ d[i]={w[i],i}; } sort(d,d+w.size(),mcp); ll r=0; for(int i=w.size()-1;i>0;i--){ if(r<l){ r+=d[i].a; g.push({d[i].a,d[i].n}); }else{ q.push({d[i].a,d[i].n}); } } while(q.size()>0 && r>u && g.size()>0){ r-=g.top().fr; g.pop(); g.push(q.top()); r+=q.top().fr; q.pop(); } //cout<<r<<" "<<l<<" "<<u<<" "<<g.size()<<endl; if(r<l || r>u)return std::vector<int>(0); vector<int>res; while(g.size()>0){ res.pb(int(g.top().sc)); //cout<<g.top().sc<<endl; g.pop(); } sort(res.begin(),res.end()); return res; }

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:27:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i=0;i<w.size();i++){
      |                 ~^~~~~~~~~
#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...