oj.uz

Submission #963826

# Submission time Handle Problem Language Result Execution time Memory
963826 2024-04-15T18:51:10 Z marinaluca Detecting Molecules (IOI16_molecules) C++17
9 / 100
 1 ms 356 KB 
#include <bits/stdc++.h>

//#include <ext/pb_ds/assoc_container.hpp>

/**#pragma GCC optimize ("O4")
#pragma GCC optimize ("fast-math")
#pragma GCC optimize ("unroll-loops")
#define int long long
#define ll long long
#define XX first
#define YY second
#define pb push_back
#define sz (x) int(x.size())
#define pf pop_front
#define pob pop_back
#define pff push_front
**/
using namespace std;
#include "molecules.h"
/**

typedef ldb long double;
typedef vii vector <int>;
typedef pid pair <double, double>;
typedef pii pair <int, int>;
typedef ull unsigned long long;
**/
vector <int> find_subset (const int l, const int u,const  vector <int> w){
    vector < pair <long long, long long>> ans;
    vector <int> v;
    for (long long i = 0; i < w.size(); ++ i){
        ans.push_back({w[i], i});
    }
    sort (ans.begin(), ans.end());
    for (long long i = 0, sum = 0, cnt = 0; i < w.size(); ++ i){
        sum += ans[i].first;
        while (sum > u){
            sum -= ans[i].first;
            ++ cnt;
        }
        if (sum >= l){
            for (long long idx = cnt; idx <= i; ++ idx){
                v.push_back(ans[idx].second);
            }
            break;
        }
    }
    return v;
}
/**
signed main(void){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    return 0 ^ 0;
}
**/

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:31:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for (long long i = 0; i < w.size(); ++ i){
      |                           ~~^~~~~~~~~~
molecules.cpp:35:47: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for (long long i = 0, sum = 0, cnt = 0; i < w.size(); ++ i){
      |                                             ~~^~~~~~~~~~

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Contestant can not find answer, jury can
2 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 348 KB OK (n = 2, answer = YES)
5 Correct 1 ms 356 KB OK (n = 2, answer = YES)
6 Correct 1 ms 344 KB OK (n = 3, answer = YES)
7 Correct 0 ms 344 KB OK (n = 3, answer = YES)
8 Correct 1 ms 344 KB OK (n = 3, answer = YES)
9 Correct 0 ms 348 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 0 ms 348 KB OK (n = 3, answer = YES)
12 Correct 0 ms 348 KB OK (n = 3, answer = YES)
13 Correct 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 1 ms 344 KB OK (n = 3, answer = NO)
17 Correct 1 ms 348 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 348 KB OK (n = 100, answer = YES)
20 Incorrect 0 ms 348 KB Contestant can not find answer, jury can
21 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 348 KB OK (n = 2, answer = YES)
5 Correct 1 ms 356 KB OK (n = 2, answer = YES)
6 Correct 1 ms 344 KB OK (n = 3, answer = YES)
7 Correct 0 ms 344 KB OK (n = 3, answer = YES)
8 Correct 1 ms 344 KB OK (n = 3, answer = YES)
9 Correct 0 ms 348 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 0 ms 348 KB OK (n = 3, answer = YES)
12 Correct 0 ms 348 KB OK (n = 3, answer = YES)
13 Correct 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 1 ms 344 KB OK (n = 3, answer = NO)
17 Correct 1 ms 348 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 348 KB OK (n = 100, answer = YES)
20 Incorrect 0 ms 348 KB Contestant can not find answer, jury can
21 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 348 KB OK (n = 2, answer = YES)
5 Correct 1 ms 356 KB OK (n = 2, answer = YES)
6 Correct 1 ms 344 KB OK (n = 3, answer = YES)
7 Correct 0 ms 344 KB OK (n = 3, answer = YES)
8 Correct 1 ms 344 KB OK (n = 3, answer = YES)
9 Correct 0 ms 348 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 0 ms 348 KB OK (n = 3, answer = YES)
12 Correct 0 ms 348 KB OK (n = 3, answer = YES)
13 Correct 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 1 ms 344 KB OK (n = 3, answer = NO)
17 Correct 1 ms 348 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 348 KB OK (n = 100, answer = YES)
20 Incorrect 0 ms 348 KB Contestant can not find answer, jury can
21 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 348 KB OK (n = 2, answer = YES)
5 Correct 1 ms 356 KB OK (n = 2, answer = YES)
6 Correct 1 ms 344 KB OK (n = 3, answer = YES)
7 Correct 0 ms 344 KB OK (n = 3, answer = YES)
8 Correct 1 ms 344 KB OK (n = 3, answer = YES)
9 Correct 0 ms 348 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 0 ms 348 KB OK (n = 3, answer = YES)
12 Correct 0 ms 348 KB OK (n = 3, answer = YES)
13 Correct 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 1 ms 344 KB OK (n = 3, answer = NO)
17 Correct 1 ms 348 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 348 KB OK (n = 100, answer = YES)
20 Incorrect 0 ms 348 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -