oj.uz

Submission #282075

# Submission time Handle Problem Language Result Execution time Memory
282075 2020-08-23T23:36:27 Z diegoangulo5 Detecting Molecules (IOI16_molecules) C++14
0 / 100
 1 ms 256 KB 
#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> responder(vector<pair<int, int> > x, int a, int b){
    vector<int> res;
    for(;a<=b;a++){
        res.push_back(x[a].second);
    }
    sort(res.begin(), res.end());
    return res;
}

vector<int> find_subset(int l, int u, vector<int> w) {
    vector<pair<int, int> >x;
    for(int a=0;a<w.size();a++){
        x.push_back(make_pair(w[a], a));
    }
    for(int a=0;a<w.size();a++){
        x.push_back(make_pair(w[a], a));
    }
    sort(x.begin(), x.end());
    int a=0, b=0;
    int sum = x[a].first;
    int tam = x.size();
    while(1){
        if(b-a+1 > tam/2)return vector<int>();
        if(sum >= l && sum <= u){
            return responder(x, a, b);
        }
        else if(sum > u){
            sum -= x[a].first;
            a++;
            if(a==tam)return vector<int>();
            if(a>b){
                b++;
                sum = x[b].first;
            }
        }
        else if(sum<l){
            b++;
            if(b==tam)return vector<int>();
            sum += x[b].first;
        }
        if(b-a+1 > tam/2)return vector<int>();
    }
    return vector<int>();
}

Compilation message

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

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Incorrect 0 ms 256 KB item #0 is taken twice
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB item #4 is taken twice
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Incorrect 0 ms 256 KB item #0 is taken twice
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Incorrect 0 ms 256 KB item #0 is taken twice
5 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Incorrect 0 ms 256 KB item #0 is taken twice
5 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Incorrect 0 ms 256 KB item #0 is taken twice
5 Halted 0 ms 0 KB -