제출 #895476

#제출 시각아이디문제언어결과실행 시간메모리
895476ByeWorldDetecting Molecules (IOI16_molecules)C++14
0 / 100
1091 ms348 KiB
#include "molecules.h" #include <bits/stdc++.h> #define fi first #define se second #define pb push_back using namespace std; typedef pair<int,int> pii; int le = 0, ri = -1, sum = 0; std::vector<int> find_subset(int l, int r, std::vector<int> w) { vector <pii> ma; for(int i=0; i<w.size(); i++) ma.pb({w[i], i}); sort(ma.begin(), ma.end()); int n = w.size(); while(le < n){ while(ri+1 < n && sum < l){ ri++; sum += ma[ri].fi; } while(le < n && sum > r){ //cout << le << ' ' << ri << ' ' << sum << " sum\n"; sum -= ma[le].fi; le++; } if(l<=sum && sum<=r) break; } vector <int> ans; if(le<n && l<=sum && sum<=r) for(int i=le; i<=ri; i++) ans.pb(ma[i].se); sort(ans.begin(), ans.end()); return ans; }

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

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