oj.uz

답안 #218536

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
218536 2020-04-02T09:04:08 Z emil_physmath Detecting Molecules (IOI16_molecules) C++17
0 / 100
 5 ms 384 KB 
#include "molecules.h"
#include <iostream>
#include <vector>
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w)
{
    int n = w.size();
    vector<vector<bool> > dp(n, vector<bool>(u + 1));
    vector<vector<bool> > take(n, vector<bool>(u + 1));
    dp[0][0] = dp[0][w[0]] = true;
    take[0][w[0]] = true;
    for (int i = 1; i < n; ++i)
    {
        dp[i][0] = true;
        take[i][0] = false;
        for (int j = 1; j <= u; ++j)
            if (dp[i - 1][j])
            {
                take[i][j] = false;
                dp[i][j] = true;
            }
            else if (j - w[i] >= 0 && dp[i - 1][j - w[i]])
            {
                take[i][j] = true;
                dp[i][j] = true;
            }
    }
    for (int j = l; j <= u; ++j)
        if (dp[n - 1][j] != -1)
        {
            vector<int> res;
            for (int i = n - 1; i >= 0; --i)
                if (take[i][j])
                {
                    res.push_back(i);
                    j -= w[i];
                }
            return res;
        }
    return vector<int>(0);
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 KB OK (n = 1, answer = YES)
4 Correct 5 ms 384 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 384 KB OK (n = 3, answer = YES)
7 Correct 5 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Incorrect 5 ms 256 KB Contestant can not find answer, jury can
12 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB OK (n = 12, answer = YES)
2 Correct 5 ms 256 KB OK (n = 12, answer = YES)
3 Correct 5 ms 384 KB OK (n = 12, answer = NO)
4 Correct 5 ms 256 KB OK (n = 12, answer = NO)
5 Incorrect 5 ms 384 KB Contestant can not find answer, jury can
6 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 KB OK (n = 1, answer = YES)
4 Correct 5 ms 384 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 384 KB OK (n = 3, answer = YES)
7 Correct 5 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Incorrect 5 ms 256 KB Contestant can not find answer, jury can
12 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 KB OK (n = 1, answer = YES)
4 Correct 5 ms 384 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 384 KB OK (n = 3, answer = YES)
7 Correct 5 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Incorrect 5 ms 256 KB Contestant can not find answer, jury can
12 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 KB OK (n = 1, answer = YES)
4 Correct 5 ms 384 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 384 KB OK (n = 3, answer = YES)
7 Correct 5 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Incorrect 5 ms 256 KB Contestant can not find answer, jury can
12 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 KB OK (n = 1, answer = YES)
4 Correct 5 ms 384 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 384 KB OK (n = 3, answer = YES)
7 Correct 5 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Incorrect 5 ms 256 KB Contestant can not find answer, jury can
12 Halted 0 ms 0 KB -