oj.uz

답안 #1089866

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089866 2024-09-17T10:19:21 Z Frostidian Detecting Molecules (IOI16_molecules) C++14
9 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
 
vector < int > find_subset ( int l, int r, vector < int > isi ){
    int sa = 0;
    
    vector < int > ans;
 
    for ( int i = 1; i <= isi.size(); i++ ){
        sa += isi[i - 1];
        if ( sa >= l && sa <= r ){
            for ( int j = 1; j <= i; j++ ){
                ans.push_back(j - 1);
            }

            return ans;
        }
    }
 
    return ans;
}
/* 
signed main(){
    vector < int > isi {2, 2, 2, 2, 2};
    vector < int > ans = find_subset ( 4, 4, isi );
    for ( auto x : ans ) cout << x << endl;
}
*/

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:9:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for ( int i = 1; i <= isi.size(); i++ ){
      |                      ~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 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 1 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 344 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 1 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 0 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 1 ms 344 KB OK (n = 100, answer = YES)

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 1 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 344 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 1 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 0 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 1 ms 344 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

# 결과 실행 시간 메모리 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 1 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 344 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 1 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 0 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 1 ms 344 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

# 결과 실행 시간 메모리 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 1 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 344 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 1 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 0 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 1 ms 344 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

# 결과 실행 시간 메모리 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 1 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 344 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 1 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 0 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 1 ms 344 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 -