oj.uz

답안 #131625

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
131625 2019-07-17T10:42:21 Z neki Detecting Molecules (IOI16_molecules) C++14
0 / 100
 2 ms 376 KB 
#include "molecules.h"

#include <bits/stdc++.h>

#define loop(i, a, b) for(int i=a;i<b;i++)
#define cc(a) cout<< a << endl;
using namespace std;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    map<int, int> dp;
    vector<int> ans;
    loop(i, 1, w.size()+1){
        for(auto&& j: dp) if(j.first+w[i-1]<=u and dp[j.first+w[i-1]]==0) dp[j.first+w[i-1]]=i;
        if(dp[w[i-1]]==0)dp[w[i-1]]=i;
        auto it=dp.lower_bound(l);
        if(it!=dp.end() and it->second!=0 and l<=it->first and it->first<=u){
            int cnt=it->first;
            while(cnt!=0){
                ans.push_back(dp[cnt]-1);
                cnt-=w[dp[cnt]-1];
            }
            break;
        }
    }
    return ans;
}

Compilation message

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

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 256 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Incorrect 2 ms 376 KB item #1 is taken twice
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB item #6 is taken twice
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 256 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Incorrect 2 ms 376 KB item #1 is taken twice
8 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 256 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Incorrect 2 ms 376 KB item #1 is taken twice
8 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 256 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Incorrect 2 ms 376 KB item #1 is taken twice
8 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 256 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Incorrect 2 ms 376 KB item #1 is taken twice
8 Halted 0 ms 0 KB -