제출 #53967

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
53967		Alexa2001	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	3 ms	756 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

vector< pair<int,int> > W;
vector<ll> S;

vector<int> solution(int x, int y)
{
    vector<int> ans;
    for(int i=x; i<=y; ++i)
        ans.push_back(W[i].second);
    return ans;
}

vector<int> find_subset(int L, int R, vector<int> w)
{
    int i, j;

    for(i=0; i<w.size(); ++i) W.push_back({w[i], i});
    sort(W.begin(), W.end());

    ll sum = 0;
    for(i=0; i<W.size(); ++i)
    {
        sum += W[i].first;
        S.push_back(sum);
    }

    j = 0;
    while(j<S.size() && S[j] < L) ++j;
    if(S[j] <= R)
        return solution(0, j);

    for(i=0; i<S.size(); ++i)
    {
        while(j<S.size() && S[j] - S[i] < L) ++j;
        if(j<S.size() && S[j] - S[i] <= R) return solution(i+1, j);
    }

    return vector<int> ();
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:22:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0; i<w.size(); ++i) W.push_back({w[i], i});
              ~^~~~~~~~~
molecules.cpp:26:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0; i<W.size(); ++i)
              ~^~~~~~~~~
molecules.cpp:33:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(j<S.size() && S[j] < L) ++j;
           ~^~~~~~~~~
molecules.cpp:37:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0; i<S.size(); ++i)
              ~^~~~~~~~~
molecules.cpp:39:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(j<S.size() && S[j] - S[i] < L) ++j;
               ~^~~~~~~~~
molecules.cpp:40:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(j<S.size() && S[j] - S[i] <= R) return solution(i+1, j);
            ~^~~~~~~~~

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