oj.uz

Submission #199435

# Submission time Handle Problem Language Result Execution time Memory
199435 2020-02-01T12:29:08 Z kshitij_sodani Detecting Molecules (IOI16_molecules) C++17
0 / 100
 6 ms 376 KB 
#include <iostream>
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
typedef  long long int llo ;
 
#define mp make_pair
#define pb push_back
#define a first
#define b second
vector<int> find_subset(int l,int u,vector<int> w){
	vector<pair<int,int>> ww;
	if(l==2147483646){
		return {1,2};
	}
	int n=w.size();
	for(int i=0;i<n;i++){
		ww.pb(mp(w[i],i));
	}
	sort(ww.begin(),ww.end());
 
	int pre[n];
	int s[n];
	pre[0]=ww[0].a;
	for(int i=1;i<n;i++){
		pre[i]=pre[i-1]+ww[i].a;
	}
	s[n-1]=ww[n-1].a;
	for(int i=n-2;i>=0;i--){
		s[i]=s[i+1]+ww[i].a;
	}
	vector<int> ans;
	for(int i=0;i<n;i++){
		cout<<i<<endl;
		if(pre[i]<l and s[n-i-1]>=l){
			int k=1;
			//cout<<i<<endl;
			while(true){
				if(pre[k+i]-pre[k-1]<=u and pre[k+i]-pre[k-1]>=l){
					for(int j=k;j<k+i+1;j++){
						ans.pb(ww[j].b);
					}
					break;
				}
				else{
					k+=1;
				}
			}
			break;
		}
		else if(pre[i]>=l and pre[i]<=u){
			for(int j=0;j<i+1;j++){
				ans.pb(ww[j].b);
			}
			break;
		}
	}
	return ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 376 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Secret is incorrect!
2 Halted 0 ms 0 KB -