oj.uz

Submission #1102546

# Submission time Handle Problem Language Result Execution time Memory
1102546 2024-10-18T09:04:19 Z adiyer Detecting Molecules (IOI16_molecules) C++17
0 / 100
 2 ms 588 KB 
#include "molecules.h"

#include <bits/stdc++.h>

#define ll long long

using namespace std;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    ll s = 0, L = l, R = u;
    int n = w.size();
    vector < int > ans;
    vector < pair < int, int > > a;
    for(int i = 0; i < n; i++) a.push_back({w[i], i});
    sort(a.begin(), a.end());
    int j = 0;
    for(int i = 0; i < n; i++) s += a[i].first;
    for(int i = 0; i < n; i++){
    	while(j <= i) s -= a[j].first, j++;
    	s += a[i].first;
    	while(s > R && j < n) s -= a[j].first, j++;
    	if(L <= s && s <= R){
    		for(int it = 0; it <= i; it++) ans.push_back(a[it].second);
		    for(int it = max(j, i + 1); it < n; it++) ans.push_back(a[it].second);
		    return ans;
    	}
    }
    for(int i = 0; i < n; i++){
    	s += a[i].first;
    	if(L <= s && s <= R){
    		for(int j = 0; j <= i; j++) ans.push_back(a[j].second);
		    // for(int it : ans) cout << it << ' ';
		    // cout << '\n';
    		return ans;
    	}
    }
    s = 0;
    reverse(a.begin(), a.end());
    for(int i = 0; i < n; i++){
    	s += a[i].first;
    	if(L <= s && s <= R){
		    for(int j = 0; j <= i; j++) ans.push_back(a[j].second);
    		// for(int it : ans) cout << it << ' ';
		    // cout << '\n';
    		return ans;
    	}
    }
    int it = 5000;
    while(it--){
    	s = 0;
	    random_shuffle(a.begin(), a.end());
	    for(int i = 0; i < n; i++){
	    	s += a[i].first;
	    	if(L <= s && s <= R){
			    for(int j = 0; j <= i; j++) ans.push_back(a[j].second);
	    		return ans;
	    	}
	    }
    }
    return ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB OK (n = 1, answer = NO)
2 Correct 1 ms 560 KB OK (n = 1, answer = NO)
3 Correct 0 ms 336 KB OK (n = 1, answer = YES)
4 Correct 1 ms 504 KB OK (n = 2, answer = YES)
5 Correct 1 ms 336 KB OK (n = 2, answer = YES)
6 Correct 1 ms 336 KB OK (n = 3, answer = YES)
7 Correct 1 ms 336 KB OK (n = 3, answer = YES)
8 Correct 1 ms 336 KB OK (n = 3, answer = YES)
9 Correct 1 ms 336 KB OK (n = 3, answer = YES)
10 Correct 1 ms 336 KB OK (n = 3, answer = YES)
11 Correct 1 ms 336 KB OK (n = 3, answer = YES)
12 Correct 1 ms 588 KB OK (n = 3, answer = YES)
13 Correct 1 ms 336 KB OK (n = 3, answer = NO)
14 Correct 1 ms 336 KB OK (n = 3, answer = YES)
15 Correct 1 ms 336 KB OK (n = 3, answer = YES)
16 Correct 1 ms 336 KB OK (n = 3, answer = NO)
17 Incorrect 1 ms 336 KB sum of weights should be in [16..20] but it is 5
18 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB OK (n = 12, answer = YES)
2 Correct 1 ms 336 KB OK (n = 12, answer = YES)
3 Correct 2 ms 336 KB OK (n = 12, answer = NO)
4 Correct 1 ms 336 KB OK (n = 12, answer = NO)
5 Correct 1 ms 336 KB OK (n = 12, answer = YES)
6 Correct 1 ms 336 KB OK (n = 12, answer = YES)
7 Correct 1 ms 336 KB OK (n = 12, answer = YES)
8 Correct 1 ms 336 KB OK (n = 12, answer = YES)
9 Correct 1 ms 336 KB OK (n = 6, answer = YES)
10 Correct 1 ms 336 KB OK (n = 12, answer = YES)
11 Incorrect 1 ms 348 KB sum of weights should be in [150..150] but it is 50
12 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB OK (n = 1, answer = NO)
2 Correct 1 ms 560 KB OK (n = 1, answer = NO)
3 Correct 0 ms 336 KB OK (n = 1, answer = YES)
4 Correct 1 ms 504 KB OK (n = 2, answer = YES)
5 Correct 1 ms 336 KB OK (n = 2, answer = YES)
6 Correct 1 ms 336 KB OK (n = 3, answer = YES)
7 Correct 1 ms 336 KB OK (n = 3, answer = YES)
8 Correct 1 ms 336 KB OK (n = 3, answer = YES)
9 Correct 1 ms 336 KB OK (n = 3, answer = YES)
10 Correct 1 ms 336 KB OK (n = 3, answer = YES)
11 Correct 1 ms 336 KB OK (n = 3, answer = YES)
12 Correct 1 ms 588 KB OK (n = 3, answer = YES)
13 Correct 1 ms 336 KB OK (n = 3, answer = NO)
14 Correct 1 ms 336 KB OK (n = 3, answer = YES)
15 Correct 1 ms 336 KB OK (n = 3, answer = YES)
16 Correct 1 ms 336 KB OK (n = 3, answer = NO)
17 Incorrect 1 ms 336 KB sum of weights should be in [16..20] but it is 5
18 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB OK (n = 1, answer = NO)
2 Correct 1 ms 560 KB OK (n = 1, answer = NO)
3 Correct 0 ms 336 KB OK (n = 1, answer = YES)
4 Correct 1 ms 504 KB OK (n = 2, answer = YES)
5 Correct 1 ms 336 KB OK (n = 2, answer = YES)
6 Correct 1 ms 336 KB OK (n = 3, answer = YES)
7 Correct 1 ms 336 KB OK (n = 3, answer = YES)
8 Correct 1 ms 336 KB OK (n = 3, answer = YES)
9 Correct 1 ms 336 KB OK (n = 3, answer = YES)
10 Correct 1 ms 336 KB OK (n = 3, answer = YES)
11 Correct 1 ms 336 KB OK (n = 3, answer = YES)
12 Correct 1 ms 588 KB OK (n = 3, answer = YES)
13 Correct 1 ms 336 KB OK (n = 3, answer = NO)
14 Correct 1 ms 336 KB OK (n = 3, answer = YES)
15 Correct 1 ms 336 KB OK (n = 3, answer = YES)
16 Correct 1 ms 336 KB OK (n = 3, answer = NO)
17 Incorrect 1 ms 336 KB sum of weights should be in [16..20] but it is 5
18 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB OK (n = 1, answer = NO)
2 Correct 1 ms 560 KB OK (n = 1, answer = NO)
3 Correct 0 ms 336 KB OK (n = 1, answer = YES)
4 Correct 1 ms 504 KB OK (n = 2, answer = YES)
5 Correct 1 ms 336 KB OK (n = 2, answer = YES)
6 Correct 1 ms 336 KB OK (n = 3, answer = YES)
7 Correct 1 ms 336 KB OK (n = 3, answer = YES)
8 Correct 1 ms 336 KB OK (n = 3, answer = YES)
9 Correct 1 ms 336 KB OK (n = 3, answer = YES)
10 Correct 1 ms 336 KB OK (n = 3, answer = YES)
11 Correct 1 ms 336 KB OK (n = 3, answer = YES)
12 Correct 1 ms 588 KB OK (n = 3, answer = YES)
13 Correct 1 ms 336 KB OK (n = 3, answer = NO)
14 Correct 1 ms 336 KB OK (n = 3, answer = YES)
15 Correct 1 ms 336 KB OK (n = 3, answer = YES)
16 Correct 1 ms 336 KB OK (n = 3, answer = NO)
17 Incorrect 1 ms 336 KB sum of weights should be in [16..20] but it is 5
18 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB OK (n = 1, answer = NO)
2 Correct 1 ms 560 KB OK (n = 1, answer = NO)
3 Correct 0 ms 336 KB OK (n = 1, answer = YES)
4 Correct 1 ms 504 KB OK (n = 2, answer = YES)
5 Correct 1 ms 336 KB OK (n = 2, answer = YES)
6 Correct 1 ms 336 KB OK (n = 3, answer = YES)
7 Correct 1 ms 336 KB OK (n = 3, answer = YES)
8 Correct 1 ms 336 KB OK (n = 3, answer = YES)
9 Correct 1 ms 336 KB OK (n = 3, answer = YES)
10 Correct 1 ms 336 KB OK (n = 3, answer = YES)
11 Correct 1 ms 336 KB OK (n = 3, answer = YES)
12 Correct 1 ms 588 KB OK (n = 3, answer = YES)
13 Correct 1 ms 336 KB OK (n = 3, answer = NO)
14 Correct 1 ms 336 KB OK (n = 3, answer = YES)
15 Correct 1 ms 336 KB OK (n = 3, answer = YES)
16 Correct 1 ms 336 KB OK (n = 3, answer = NO)
17 Incorrect 1 ms 336 KB sum of weights should be in [16..20] but it is 5
18 Halted 0 ms 0 KB -