제출 #706524

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
706524		stoyan_malinin	Detecting Molecules (IOI16_molecules)	C++14	19 / 100	1 ms	424 KiB

molecules

#include "molecules.h"
//#include "grader.cpp"
 
#include <bitset>
#include <time.h>
#include <random>
#include <cstring>
#include <algorithm>
 
using namespace std;
 
const int MAXN = 5e5 + 5;
mt19937 rnd(22);
 
int dp[MAXN];
 
void filterVector(vector <int> &v, int lim)
{
    vector <int> newVal;
    for(int x: v)
    {
        if(x<=lim) newVal.push_back(x);
    }
 
    v = newVal;
}
 
vector <int> recoverAnswer(int x, vector <int> &w)
{
    vector <int> answer;
 
    while(x!=0)
    {
        answer.push_back(dp[x]);
        x = x - w[ dp[x] ];
    }
 
    return answer;
}
 
vector <int> solveSingle(int l, int u, vector <int> &w)
{
    for(int i = 0;i<w.size();i++)
    {
        if(w[i]>=l && w[i]<=u) return vector <int> {i};
    }
 
    return vector <int> {};
}
 
vector <int> solveDouble(int l, int u, vector <int> w)
{
    sort(w.begin(), w.end());
    for(int i = 0;i<w.size()-1;i++)
    {
        if(w[i]+w[i+1]>u) break;
        if(w[i]+w.back()<l) continue;
 
        int low = i + 1, high = w.size() - 1, mid;
        while(low+1<high)
        {
            mid = (low+high)/2;
 
            if(w[i]+w[mid]>=l) high = mid;
            else low = mid + 1;
        }
 
        if(low<w.size() && w[i]+w[low]>=l && w[i]+w[low]<=u) return vector <int> {i, low};
        if(high<w.size() && w[i]+w[high]>=l && w[i]+w[high]<=u) return vector <int> {i, high};
    }
 
    return vector <int> {};
}
 
vector <int> specialCaseSolutions(int l, int u, vector <int> &w)
{
    vector <int> answer = {};
 
    answer = solveSingle(l, u, w);
    if(answer.empty()==false) return answer;
 
    answer = solveDouble(l, u, w);
    if(answer.empty()==false) return answer;
 
    return vector <int> {};
}
 
vector<int> find_subset(int l, int u, vector <int> w)
{
    for(int i = 0;i<w.size();i++)
    {
        if(w[i]>=l && w[i]<=u) return vector <int> {i};
    }
 
    vector <pair <int, int>> v;
    for(int i = 0;i<w.size();i++) v.push_back({w[i], i});
    //sort(v.begin(), v.end());
 
    int ind = 0;
    long long sum = v[0].first;
 
    for(int i = 1;i<v.size();i++)
    {
        if(v[i].first>u)  break;
 
        sum += v[i].first;
        while(sum>u) sum -= v[ind].first, ind++;
 
        if(sum>=l && sum<=u)
        {
            vector <int> answer;
            for(int j = ind;j<=i;j++) answer.push_back(v[j].second);
 
            return answer;
        }
    }
 
    return vector <int> {};
}

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

molecules.cpp: In function 'std::vector<int> solveSingle(int, int, std::vector<int>&)':
molecules.cpp:43:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for(int i = 0;i<w.size();i++)
      |                   ~^~~~~~~~~
molecules.cpp: In function 'std::vector<int> solveDouble(int, int, std::vector<int>)':
molecules.cpp:54:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(int i = 0;i<w.size()-1;i++)
      |                   ~^~~~~~~~~~~
molecules.cpp:68:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         if(low<w.size() && w[i]+w[low]>=l && w[i]+w[low]<=u) return vector <int> {i, low};
      |            ~~~^~~~~~~~~
molecules.cpp:69:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         if(high<w.size() && w[i]+w[high]>=l && w[i]+w[high]<=u) return vector <int> {i, high};
      |            ~~~~^~~~~~~~~
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:90:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     for(int i = 0;i<w.size();i++)
      |                   ~^~~~~~~~~
molecules.cpp:96:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |     for(int i = 0;i<w.size();i++) v.push_back({w[i], i});
      |                   ~^~~~~~~~~
molecules.cpp:102:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |     for(int i = 1;i<v.size();i++)
      |                   ~^~~~~~~~~

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