oj.uz

Submission #953850

# Submission time Handle Problem Language Result Execution time Memory
953850 2024-03-26T18:10:47 Z emad234 Detecting Molecules (IOI16_molecules) C++17
10 / 100
 1 ms 444 KB 
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pii pair<ll, ll>
const ll mod = 1e9 + 7;
const ll mxN = 1e6 + 5;
using namespace std;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n = w.size();
    int R = n - 1;
    int num = w[n - 1];
    vector<int>ans;
    if(num >= l && num <= u) return {num};
    for(int i = n - 2;i >= 0;i--){
        if(num > u){
            num -= w[R];
            R--;
        }
        num += w[i];
        if (num >= l && num <= u){
            for(int j = i; j<= R;j++) ans.push_back(j);
            return ans;
        }
    }
    return {};
}

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 Incorrect 0 ms 348 KB Integer 10 violates the range [0, 0]
4 Halted 0 ms 0 KB -

Subtask #2
10.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 348 KB OK (n = 12, answer = NO)
4 Correct 0 ms 360 KB OK (n = 12, answer = NO)
5 Correct 0 ms 352 KB OK (n = 12, answer = YES)
6 Correct 0 ms 348 KB OK (n = 12, answer = YES)
7 Correct 0 ms 360 KB OK (n = 12, answer = YES)
8 Correct 0 ms 356 KB OK (n = 12, answer = YES)
9 Correct 0 ms 352 KB OK (n = 6, answer = YES)
10 Correct 1 ms 352 KB OK (n = 12, answer = YES)
11 Correct 0 ms 444 KB OK (n = 100, answer = NO)
12 Correct 0 ms 356 KB OK (n = 100, answer = YES)
13 Correct 0 ms 360 KB OK (n = 100, answer = NO)
14 Correct 0 ms 440 KB OK (n = 100, answer = YES)
15 Correct 1 ms 360 KB OK (n = 100, answer = YES)
16 Correct 1 ms 356 KB OK (n = 100, answer = YES)
17 Correct 0 ms 352 KB OK (n = 100, answer = YES)

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 Incorrect 0 ms 348 KB Integer 10 violates the range [0, 0]
4 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 Incorrect 0 ms 348 KB Integer 10 violates the range [0, 0]
4 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 Incorrect 0 ms 348 KB Integer 10 violates the range [0, 0]
4 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 Incorrect 0 ms 348 KB Integer 10 violates the range [0, 0]
4 Halted 0 ms 0 KB -