제출 #1023370

#제출 시각아이디문제언어결과실행 시간메모리
1023370vjudge1Detecting Molecules (IOI16_molecules)C++17
46 / 100
2 ms860 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define nl "\n" #define pi pair<int, int> #define mp make_pair #define ff first #define ss second vector<int> find_subset(int l, int u, vector<int> w){ ll n = w.size(); vector<pi> num(n, mp(0, 0)); for (ll i=0; i<w.size(); i++) num[i] = mp(w[i], i); sort(num.begin(), num.end()); ll sum = 0, start = 0; while(sum<l){ sum += num[start].ff; start++; } ll front=-1, back=-1; if(sum>=l && sum<=u){ front = 0; back = start-1; } else{ ll size = start-1; // 0 to start-2 sum -= num[start-1].ff; for (ll i=start-1; i<n; i++){ sum -= num[i-size].ff; sum += num[i].ff; if(sum>=l && sum<=u){ front = i-size+1; back = i; break; } } } vector<int> v; if(front==-1 && back==-1) return v; for (ll i=front; i<=back; i++){ v.push_back(num[i].ss); } return v; }

컴파일 시 표준 에러 (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: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |  for (ll i=0; i<w.size(); i++) num[i] = mp(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...