oj.uz

Submission #74652

# Submission time Handle Problem Language Result Execution time Memory
74652 2018-09-05T14:05:48 Z kjain_1810 Detecting Molecules (IOI16_molecules) C++17
0 / 100
 2 ms 576 KB 
#include "molecules.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
using namespace std;

typedef long long ll;

vector< pair<ll, ll> >vec;
ll u, l;

std::vector<int> find_subset(int L, int U, std::vector<int> w) {
    for(ll a=0; a<w.size(); a++)
    	vec.pb({w[a], a});
    sort(vec.begin(), vec.end());
    ll ptr=0, sum=vec[0].f, u=U, l=L, ptr2=1;
    bool flag=false;
    for(ll a=1; a<vec.size(); a++)
    {
    	if(sum<=u && sum>=l)
    	{
    		flag=true;
    		ptr2=a;
    		break;
    	}
    	sum+=vec[a].f;
    	if(sum<=u && sum>=l)
    	{
    		flag=true;
    		ptr2=a+1;
    		break;
    	}
    	while(sum>u)
    	{
    		sum-=vec[ptr].f;
    		ptr++;
    	}
    }
    if(!flag)
    {
    	vector<int>yo;
    	yo.clear();
    	return yo;
    }
    vector<int>yo;
    for(ll b=ptr; b<ptr2; b++)
    {
    	yo.pb(w[vec[b].s]);
    }
    return yo;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:14:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(ll a=0; a<w.size(); a++)
                 ~^~~~~~~~~
molecules.cpp:19:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(ll a=1; a<vec.size(); a++)
                 ~^~~~~~~~~~~

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 372 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 576 KB Contestant can not find answer, jury can
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 576 KB Integer 50 violates the range [0, 11]
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 372 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 576 KB Contestant can not find answer, jury can
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 372 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 576 KB Contestant can not find answer, jury can
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 372 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 576 KB Contestant can not find answer, jury can
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 372 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 576 KB Contestant can not find answer, jury can
4 Halted 0 ms 0 KB -