oj.uz

Submission #170022

# Submission time Handle Problem Language Result Execution time Memory
170022 2019-12-23T16:58:42 Z whttt Detecting Molecules (IOI16_molecules) C++14
0 / 100
 2 ms 380 KB 

#include <iostream>
#include <vector>
#include <algorithm>
#define ll long long

using namespace std;

vector<ll> find_subset(int l, int u, vector<int> w){
    ll sum = 0;
    vector<ll> returnThis;
    sort(w.begin(), w.end());
    for(ll i = 0;i < w.size();i++){
        sum += w[i];
        //cout << sum << endl;
        if(sum <= u && sum >= l){
            for(ll j = 0;j <= i;j++){
                returnThis.push_back(j);
            }
            return returnThis;
        } else if(sum > l){
            sum -= w[i];
            for(ll j = i;j < w.size();j++){
                sum += w[j]-w[j-i];
                if(sum <= u && sum >= l){
                    for(ll k = j-i+1;k <= i;k++){
                        returnThis.push_back(k);
                    }
                    return returnThis;
                }
                if(j == w.size()-1){
                    return {};
                }
            }
        }
    }
    return {};
}

Compilation message

molecules.cpp: In function 'std::vector<long long int> find_subset(int, int, std::vector<int>)':
molecules.cpp:14:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(ll i = 0;i < w.size();i++){
                  ~~^~~~~~~~~~
molecules.cpp:24:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(ll j = i;j < w.size();j++){
                          ~~^~~~~~~~~~
molecules.cpp:32:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(j == w.size()-1){
                    ~~^~~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB OK (n = 1, answer = NO)
2 Correct 2 ms 380 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 376 KB Integer 2 violates the range [0, 1]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB OK (n = 1, answer = NO)
2 Correct 2 ms 380 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 376 KB Integer 2 violates the range [0, 1]
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB OK (n = 1, answer = NO)
2 Correct 2 ms 380 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 376 KB Integer 2 violates the range [0, 1]
4 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB OK (n = 1, answer = NO)
2 Correct 2 ms 380 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 376 KB Integer 2 violates the range [0, 1]
4 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB OK (n = 1, answer = NO)
2 Correct 2 ms 380 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 376 KB Integer 2 violates the range [0, 1]
4 Halted 0 ms 0 KB -