oj.uz

Submission #961245

# Submission time Handle Problem Language Result Execution time Memory
961245 2024-04-11T18:44:36 Z aminjon__ Detecting Molecules (IOI16_molecules) C++17
0 / 100
 1 ms 348 KB 
#include<bits/stdc++.h>
using namespace std;
pair<int,int>w2[200012];
vector <int>result;
vector<int> find_subset(int l , int r , vector<int> w){
	int n = w.size(),sum = 0 , left = 0 , right = 0;
	for(int i = 0;i < n;i++){
		w2[i].first = w[i];
		w2[i].second = i;
	}
	sort(w2 , w2+n , greater<pair<int,int>>());
	while(sum <= r && right < n){
		sum += w2[right].first;
		result.push_back(w2[right].second);
		right++;
	}
	if(sum >= l && sum <= r){
		return result;
	}
	else if(sum < l || right == n){
		result.clear();
		return result;
	}
	int last = n-1;
	while(last >= right && sum > r && left < right){
		sum -= w2[left].first-w2[last].first;
		result[left] = w2[last].second;
		last--;
		left++;
	}
	if(sum >= l && sum <= r){
		return result;
	}
	result.clear();
	return result;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 0 ms 344 KB OK (n = 2, answer = YES)
5 Incorrect 1 ms 348 KB Contestant can not find answer, jury can
6 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB OK (n = 12, answer = YES)
2 Correct 0 ms 348 KB OK (n = 12, answer = YES)
3 Correct 1 ms 344 KB OK (n = 12, answer = NO)
4 Correct 0 ms 348 KB OK (n = 12, answer = NO)
5 Correct 0 ms 344 KB OK (n = 12, answer = YES)
6 Incorrect 0 ms 348 KB Contestant can not find answer, jury can
7 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 0 ms 344 KB OK (n = 2, answer = YES)
5 Incorrect 1 ms 348 KB Contestant can not find answer, jury can
6 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 0 ms 344 KB OK (n = 2, answer = YES)
5 Incorrect 1 ms 348 KB Contestant can not find answer, jury can
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 0 ms 344 KB OK (n = 2, answer = YES)
5 Incorrect 1 ms 348 KB Contestant can not find answer, jury can
6 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 0 ms 344 KB OK (n = 2, answer = YES)
5 Incorrect 1 ms 348 KB Contestant can not find answer, jury can
6 Halted 0 ms 0 KB -