oj.uz

답안 #12056

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
12056 2014-12-20T00:26:20 Z tncks0121 배낭 문제 준비하기 (GA9_invknapsack) C++14
18 / 100
 192 ms 2848 KB 
#include <iostream>
#include <cstdio>
 
using namespace std;
 
//int good[100005][305];
int chk[100005], cur[100005];
 
int p = 1;
int res[100005], rn;
// table[i][j] : 길이 j로 답이 i인 걸 만들 수 있는가?
 
void solve (int t) {
    if(cur[t] < 0) {
      if(chk[-cur[t]] < chk[t+cur[t]]) {
        solve(-cur[t]);
        solve(t + cur[t]);
      }else{
        solve(t + cur[t]);
        solve(-cur[t]);
      }
        
    }else {
        for(int i = 0; i < chk[t]; i++) {
            res[++rn] = (i < cur[t]) ? p : 293-p;
        }
        p += cur[t]*p;
    }
}
 
int main() {
    for(int i = 1; i <= 100000; i++) chk[i] = (int)1e9;
    for(int a = 1; a <= 300; a++) {
        for(int b = 1; b <= 300-a; b++) {
        //  good[a*b][a+b] = a;
            if(chk[a*b] > a+b) {
                cur[a*b] = a;
                chk[a*b] = a+b;
            }
        }
    }
    for(int i = 1; i <= 10000; i++) if(chk[i] == (int)1e9) {
        for(int j = 1; j < i; j++) {
			if(cur[j] < 0 || cur[i-j] < 0) continue;
            if(chk[i] > chk[j] + chk[i-j]) {
                cur[i] = -j;
                (chk[i] = chk[j] + chk[i-j]);
            }
        }
    }
     
    int t; scanf("%d", &t);
    solve(t);
     
    printf("%d 293\n", rn);
    for(int i = 1; i <= rn; i++) printf("%d ", res[i]);
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 188 ms 2848 KB Output is correct
2 Correct 188 ms 2848 KB Output is correct
3 Correct 188 ms 2848 KB Output is correct
4 Correct 188 ms 2848 KB Output is correct
5 Correct 188 ms 2848 KB Output is correct
6 Correct 184 ms 2848 KB Output is correct
7 Correct 184 ms 2848 KB Output is correct
8 Correct 184 ms 2848 KB Output is correct
9 Correct 188 ms 2848 KB Output is correct
10 Correct 188 ms 2848 KB Output is correct
11 Correct 184 ms 2848 KB Output is correct
12 Correct 188 ms 2848 KB Output is correct
13 Correct 184 ms 2848 KB Output is correct
14 Correct 188 ms 2848 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 184 ms 2848 KB Output is correct
2 Correct 188 ms 2848 KB Output is correct
3 Correct 188 ms 2848 KB Output is correct
4 Correct 188 ms 2848 KB Output is correct
5 Correct 184 ms 2848 KB Output is correct
6 Correct 184 ms 2848 KB Output is correct
7 Correct 188 ms 2848 KB Output is correct
8 Correct 188 ms 2848 KB Output is correct
9 Correct 180 ms 2848 KB Output is correct
10 Correct 188 ms 2848 KB Output is correct
11 Correct 188 ms 2848 KB Output is correct
12 Correct 184 ms 2848 KB Output is correct
13 Correct 184 ms 2848 KB Output is correct
14 Correct 180 ms 2848 KB Output is correct
15 Correct 184 ms 2848 KB Output is correct
16 Correct 184 ms 2848 KB Output is correct
17 Correct 188 ms 2848 KB Output is correct
18 Correct 188 ms 2848 KB Output is correct
19 Correct 184 ms 2848 KB Output is correct
20 Correct 188 ms 2848 KB Output is correct
21 Correct 184 ms 2848 KB Output is correct
22 Correct 188 ms 2848 KB Output is correct
23 Correct 188 ms 2848 KB Output is correct
24 Correct 188 ms 2848 KB Output is correct
25 Correct 188 ms 2848 KB Output is correct
26 Correct 188 ms 2848 KB Output is correct
27 Correct 188 ms 2848 KB Output is correct
28 Correct 184 ms 2848 KB Output is correct
29 Correct 184 ms 2848 KB Output is correct
30 Correct 188 ms 2848 KB Output is correct
31 Correct 188 ms 2848 KB Output is correct
32 Correct 188 ms 2848 KB Output is correct
33 Correct 184 ms 2848 KB Output is correct
34 Correct 184 ms 2848 KB Output is correct
35 Correct 188 ms 2848 KB Output is correct
36 Correct 192 ms 2848 KB Output is correct
37 Correct 184 ms 2848 KB Output is correct

Subtask #3
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 188 ms 2844 KB SIGSEGV Segmentation fault
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -

Subtask #5
0.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -