oj.uz

답안 #59388

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
59388 2018-07-21T23:37:21 Z updown1 Detecting Molecules (IOI16_molecules) C++17
9 / 100
 4 ms 660 KB 
/*
Sort and two pointers
*/
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
typedef long long ll;
#define For(i, a, b) for(int i=a; i<b; i++)
#define ffi For(i, 0, N)
#define ffj For(j, 0, M)
#define ffa ffi ffj
#define s <<" "<<
#define c <<" : "<<
//#define w cout
#define e endl
#define pb push_back
#define mp make_pair
#define a first
#define b second
//#define int ll
const int MAXN = 3000000;
//500,000,000 operations



std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    //return std::vector<int>(0);
    sort(w.begin(), w.end());
    ll lll = 0, sum = 0;
    For (r, 0, w.size()) {
        sum += w[r];
        while (sum > u) {sum -= w[lll]; lll++;}
        assert(sum <= u);
        if (sum >= l) {
            vector<int> ret;
            For (i, lll, r+1) ret.pb(i);
            return ret;
        }
        //cout<< lll s r c sum s l s u<<e;
    }
    return std::vector<int>(0);
}

/*
main() {
    freopen("test.in", "r", stdin);
    int n, l, u;
    assert(3 == scanf("%d %d %d", &n, &l, &u));
    std::vector<int> w(n);
    for (int i = 0; i < n; i++)
        assert(1 == scanf("%d", &w[i]));
    std::vector<int> result = find_subset(l, u, w);

    printf("%d\n", (int)result.size());
    for (int i = 0; i < (int)result.size(); i++)
        printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}
*/

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:8:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define For(i, a, b) for(int i=a; i<b; i++)
molecules.cpp:30:10:
     For (r, 0, w.size()) {
          ~~~~~~~~~~~~~~             
molecules.cpp:30:5: note: in expansion of macro 'For'
     For (r, 0, w.size()) {
     ^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 488 KB OK (n = 1, answer = NO)
3 Correct 3 ms 488 KB OK (n = 1, answer = YES)
4 Correct 2 ms 488 KB OK (n = 2, answer = YES)
5 Correct 3 ms 488 KB OK (n = 2, answer = YES)
6 Correct 2 ms 520 KB OK (n = 3, answer = YES)
7 Correct 2 ms 660 KB OK (n = 3, answer = YES)
8 Correct 2 ms 660 KB OK (n = 3, answer = YES)
9 Correct 3 ms 660 KB OK (n = 3, answer = YES)
10 Correct 4 ms 660 KB OK (n = 3, answer = YES)
11 Correct 2 ms 660 KB OK (n = 3, answer = YES)
12 Correct 3 ms 660 KB OK (n = 3, answer = YES)
13 Correct 2 ms 660 KB OK (n = 3, answer = NO)
14 Correct 2 ms 660 KB OK (n = 3, answer = YES)
15 Correct 3 ms 660 KB OK (n = 3, answer = YES)
16 Correct 3 ms 660 KB OK (n = 3, answer = NO)
17 Correct 3 ms 660 KB OK (n = 3, answer = NO)
18 Correct 2 ms 660 KB OK (n = 100, answer = NO)
19 Correct 2 ms 660 KB OK (n = 100, answer = YES)

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 660 KB OK (n = 12, answer = YES)
2 Correct 2 ms 660 KB OK (n = 12, answer = YES)
3 Correct 3 ms 660 KB OK (n = 12, answer = NO)
4 Correct 2 ms 660 KB OK (n = 12, answer = NO)
5 Correct 3 ms 660 KB OK (n = 12, answer = YES)
6 Correct 3 ms 660 KB OK (n = 12, answer = YES)
7 Correct 3 ms 660 KB OK (n = 12, answer = YES)
8 Correct 2 ms 660 KB OK (n = 12, answer = YES)
9 Correct 3 ms 660 KB OK (n = 6, answer = YES)
10 Correct 2 ms 660 KB OK (n = 12, answer = YES)
11 Correct 2 ms 660 KB OK (n = 100, answer = NO)
12 Incorrect 2 ms 660 KB sum of weights should be in [50..51] but it is 73
13 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 488 KB OK (n = 1, answer = NO)
3 Correct 3 ms 488 KB OK (n = 1, answer = YES)
4 Correct 2 ms 488 KB OK (n = 2, answer = YES)
5 Correct 3 ms 488 KB OK (n = 2, answer = YES)
6 Correct 2 ms 520 KB OK (n = 3, answer = YES)
7 Correct 2 ms 660 KB OK (n = 3, answer = YES)
8 Correct 2 ms 660 KB OK (n = 3, answer = YES)
9 Correct 3 ms 660 KB OK (n = 3, answer = YES)
10 Correct 4 ms 660 KB OK (n = 3, answer = YES)
11 Correct 2 ms 660 KB OK (n = 3, answer = YES)
12 Correct 3 ms 660 KB OK (n = 3, answer = YES)
13 Correct 2 ms 660 KB OK (n = 3, answer = NO)
14 Correct 2 ms 660 KB OK (n = 3, answer = YES)
15 Correct 3 ms 660 KB OK (n = 3, answer = YES)
16 Correct 3 ms 660 KB OK (n = 3, answer = NO)
17 Correct 3 ms 660 KB OK (n = 3, answer = NO)
18 Correct 2 ms 660 KB OK (n = 100, answer = NO)
19 Correct 2 ms 660 KB OK (n = 100, answer = YES)
20 Correct 2 ms 660 KB OK (n = 12, answer = YES)
21 Correct 2 ms 660 KB OK (n = 12, answer = YES)
22 Correct 3 ms 660 KB OK (n = 12, answer = NO)
23 Correct 2 ms 660 KB OK (n = 12, answer = NO)
24 Correct 3 ms 660 KB OK (n = 12, answer = YES)
25 Correct 3 ms 660 KB OK (n = 12, answer = YES)
26 Correct 3 ms 660 KB OK (n = 12, answer = YES)
27 Correct 2 ms 660 KB OK (n = 12, answer = YES)
28 Correct 3 ms 660 KB OK (n = 6, answer = YES)
29 Correct 2 ms 660 KB OK (n = 12, answer = YES)
30 Correct 2 ms 660 KB OK (n = 100, answer = NO)
31 Incorrect 2 ms 660 KB sum of weights should be in [50..51] but it is 73
32 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 488 KB OK (n = 1, answer = NO)
3 Correct 3 ms 488 KB OK (n = 1, answer = YES)
4 Correct 2 ms 488 KB OK (n = 2, answer = YES)
5 Correct 3 ms 488 KB OK (n = 2, answer = YES)
6 Correct 2 ms 520 KB OK (n = 3, answer = YES)
7 Correct 2 ms 660 KB OK (n = 3, answer = YES)
8 Correct 2 ms 660 KB OK (n = 3, answer = YES)
9 Correct 3 ms 660 KB OK (n = 3, answer = YES)
10 Correct 4 ms 660 KB OK (n = 3, answer = YES)
11 Correct 2 ms 660 KB OK (n = 3, answer = YES)
12 Correct 3 ms 660 KB OK (n = 3, answer = YES)
13 Correct 2 ms 660 KB OK (n = 3, answer = NO)
14 Correct 2 ms 660 KB OK (n = 3, answer = YES)
15 Correct 3 ms 660 KB OK (n = 3, answer = YES)
16 Correct 3 ms 660 KB OK (n = 3, answer = NO)
17 Correct 3 ms 660 KB OK (n = 3, answer = NO)
18 Correct 2 ms 660 KB OK (n = 100, answer = NO)
19 Correct 2 ms 660 KB OK (n = 100, answer = YES)
20 Correct 2 ms 660 KB OK (n = 12, answer = YES)
21 Correct 2 ms 660 KB OK (n = 12, answer = YES)
22 Correct 3 ms 660 KB OK (n = 12, answer = NO)
23 Correct 2 ms 660 KB OK (n = 12, answer = NO)
24 Correct 3 ms 660 KB OK (n = 12, answer = YES)
25 Correct 3 ms 660 KB OK (n = 12, answer = YES)
26 Correct 3 ms 660 KB OK (n = 12, answer = YES)
27 Correct 2 ms 660 KB OK (n = 12, answer = YES)
28 Correct 3 ms 660 KB OK (n = 6, answer = YES)
29 Correct 2 ms 660 KB OK (n = 12, answer = YES)
30 Correct 2 ms 660 KB OK (n = 100, answer = NO)
31 Incorrect 2 ms 660 KB sum of weights should be in [50..51] but it is 73
32 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 488 KB OK (n = 1, answer = NO)
3 Correct 3 ms 488 KB OK (n = 1, answer = YES)
4 Correct 2 ms 488 KB OK (n = 2, answer = YES)
5 Correct 3 ms 488 KB OK (n = 2, answer = YES)
6 Correct 2 ms 520 KB OK (n = 3, answer = YES)
7 Correct 2 ms 660 KB OK (n = 3, answer = YES)
8 Correct 2 ms 660 KB OK (n = 3, answer = YES)
9 Correct 3 ms 660 KB OK (n = 3, answer = YES)
10 Correct 4 ms 660 KB OK (n = 3, answer = YES)
11 Correct 2 ms 660 KB OK (n = 3, answer = YES)
12 Correct 3 ms 660 KB OK (n = 3, answer = YES)
13 Correct 2 ms 660 KB OK (n = 3, answer = NO)
14 Correct 2 ms 660 KB OK (n = 3, answer = YES)
15 Correct 3 ms 660 KB OK (n = 3, answer = YES)
16 Correct 3 ms 660 KB OK (n = 3, answer = NO)
17 Correct 3 ms 660 KB OK (n = 3, answer = NO)
18 Correct 2 ms 660 KB OK (n = 100, answer = NO)
19 Correct 2 ms 660 KB OK (n = 100, answer = YES)
20 Correct 2 ms 660 KB OK (n = 12, answer = YES)
21 Correct 2 ms 660 KB OK (n = 12, answer = YES)
22 Correct 3 ms 660 KB OK (n = 12, answer = NO)
23 Correct 2 ms 660 KB OK (n = 12, answer = NO)
24 Correct 3 ms 660 KB OK (n = 12, answer = YES)
25 Correct 3 ms 660 KB OK (n = 12, answer = YES)
26 Correct 3 ms 660 KB OK (n = 12, answer = YES)
27 Correct 2 ms 660 KB OK (n = 12, answer = YES)
28 Correct 3 ms 660 KB OK (n = 6, answer = YES)
29 Correct 2 ms 660 KB OK (n = 12, answer = YES)
30 Correct 2 ms 660 KB OK (n = 100, answer = NO)
31 Incorrect 2 ms 660 KB sum of weights should be in [50..51] but it is 73
32 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 488 KB OK (n = 1, answer = NO)
3 Correct 3 ms 488 KB OK (n = 1, answer = YES)
4 Correct 2 ms 488 KB OK (n = 2, answer = YES)
5 Correct 3 ms 488 KB OK (n = 2, answer = YES)
6 Correct 2 ms 520 KB OK (n = 3, answer = YES)
7 Correct 2 ms 660 KB OK (n = 3, answer = YES)
8 Correct 2 ms 660 KB OK (n = 3, answer = YES)
9 Correct 3 ms 660 KB OK (n = 3, answer = YES)
10 Correct 4 ms 660 KB OK (n = 3, answer = YES)
11 Correct 2 ms 660 KB OK (n = 3, answer = YES)
12 Correct 3 ms 660 KB OK (n = 3, answer = YES)
13 Correct 2 ms 660 KB OK (n = 3, answer = NO)
14 Correct 2 ms 660 KB OK (n = 3, answer = YES)
15 Correct 3 ms 660 KB OK (n = 3, answer = YES)
16 Correct 3 ms 660 KB OK (n = 3, answer = NO)
17 Correct 3 ms 660 KB OK (n = 3, answer = NO)
18 Correct 2 ms 660 KB OK (n = 100, answer = NO)
19 Correct 2 ms 660 KB OK (n = 100, answer = YES)
20 Correct 2 ms 660 KB OK (n = 12, answer = YES)
21 Correct 2 ms 660 KB OK (n = 12, answer = YES)
22 Correct 3 ms 660 KB OK (n = 12, answer = NO)
23 Correct 2 ms 660 KB OK (n = 12, answer = NO)
24 Correct 3 ms 660 KB OK (n = 12, answer = YES)
25 Correct 3 ms 660 KB OK (n = 12, answer = YES)
26 Correct 3 ms 660 KB OK (n = 12, answer = YES)
27 Correct 2 ms 660 KB OK (n = 12, answer = YES)
28 Correct 3 ms 660 KB OK (n = 6, answer = YES)
29 Correct 2 ms 660 KB OK (n = 12, answer = YES)
30 Correct 2 ms 660 KB OK (n = 100, answer = NO)
31 Incorrect 2 ms 660 KB sum of weights should be in [50..51] but it is 73
32 Halted 0 ms 0 KB -