제출 #788095

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788095		YassirSalama	Detecting Molecules (IOI16_molecules)	C++14	69 / 100	37 ms	6788 KiB

molecules

#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define OVL(v,s) for(auto x:v) cout<<x<<s;cout<<endl;
const int MAXM=20000;
vector<vector<int>> dp(MAXM);
vector<int> v;
int L,U,N;
void find(int x){
}
#define all(v) v.begin(),v.end()
#define pb push_back
vector<int> find_subset(int l, int u, vector<int> w) {
    vector<pair<int,int>> v;
    int n=w.size();
    vector<int> pref(w.size()+100,0);
    for(int i=0;i<w.size();i++){
        v.pb({w[i],i});
    }
    sort(all(v));
    for(int i=0;i<n;i++) pref[i+1]=pref[i]+v[i].first;
    int i=0;
    int j=-1;
    int cnt=0;
    int ans=0;
    while(j<n){
        if(l<=ans&&ans<=u){
            vector<int> anns;
            for(int k=i;k<=j;k++) anns.pb(v[k].second);
            return anns;
        }
        j++;
        ans+=v[j].first;
        while(ans>u){
            ans-=v[i].first;
            i++;
        }
        
    }

    return vector<int>(0);
}


// int main() {
//     int n, l, u;
//     assert(3 == scanf("%d %d %d", &n, &l, &u));
//     std::vector<int> w(n);
//     for (int i = 0; i < n; i++)
//         assert(1 == scanf("%d", &w[i]));
//     std::vector<int> result = find_subset(l, u, w);
    
    
//     printf("%d\n", (int)result.size());
//     for (int i = 0; i < (int)result.size(); i++)
//         printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
// }

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:18:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for(int i=0;i<w.size();i++){
      |                 ~^~~~~~~~~
molecules.cpp:25:9: warning: unused variable 'cnt' [-Wunused-variable]
   25 |     int cnt=0;
      |         ^~~

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 23 / 23
• Subtask 6: 0 / 31