oj.uz

답안 #38582

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
38582 2018-01-04T13:57:50 Z bakurits 수열 (BOI14_sequence) C++14
25 / 100
 179 ms 3388 KB 
#include <iostream>
#include <stdio.h>
#include <vector>

const int N = 1e5 + 10;
const int BIG_N = 1e7;

using namespace std;

int n;
int a[N];

long long get_ans(vector <int> req) {
    long long ans = 1e17;
    int ls_dig = 0;
    while (req.size() > 0 && req[req.size() - 1] == 0)
        req.pop_back();
    if (req.size() == 0) return 0;
    if (req.size() == 1) {
        ans = 0;
        int mask = req[0];
        for (int i = 1; i < 10; i++) {
            if (mask >> i & 1) {
                ans = ans * 10 + i;
                if (mask & 1) {
                    ans = ans * 10;
                    mask--;
                }
            }
        }
        if (mask & 1)
            return 10;
        return ans;
    }

    for (int i = 0; i < 10; i++) {

        int las_dig = i;
        int curId = 0;
        vector <int> cur;
        cur.push_back(0);
        for (int j = 0; j < req.size(); j++) {
            if (las_dig == 0 && j != 0) {
                cur.push_back(0);
                curId++;
            }

            if (req[j] >> las_dig & 1) {
                cur[curId] |= (req[j] - (1 << las_dig));
            } else {
                cur[curId] |= (req[j]);
            }
            las_dig = (las_dig + 1) % 10;
        }
        int cur_ans = 1e18;
        if (cur != req)
            cur_ans = get_ans(cur);

        if (ans > cur_ans) {
            ans = cur_ans;
            ls_dig = i;
        }

    }

    return ans * 10 + ls_dig;

}

int main() {

    vector <int> req;



    scanf("%d", &n);

    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
        req.push_back(1 << a[i]);
    }



    printf("%d", get_ans(req));

}

Compilation message

sequence.cpp: In function 'long long int get_ans(std::vector<int>)':
sequence.cpp:42:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < req.size(); j++) {
                           ^
sequence.cpp:55:23: warning: overflow in implicit constant conversion [-Woverflow]
         int cur_ans = 1e18;
                       ^
sequence.cpp: In function 'int main()':
sequence.cpp:85:30: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
     printf("%d", get_ans(req));
                              ^
sequence.cpp:76:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
sequence.cpp:79:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
                           ^

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2404 KB Output is correct
2 Incorrect 0 ms 2404 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2404 KB Output is correct
2 Incorrect 0 ms 2404 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2404 KB Output is correct
2 Correct 26 ms 2544 KB Output is correct
3 Correct 36 ms 2544 KB Output is correct
4 Correct 19 ms 2544 KB Output is correct
5 Correct 16 ms 2544 KB Output is correct
6 Correct 13 ms 2544 KB Output is correct
7 Correct 119 ms 3268 KB Output is correct
8 Correct 113 ms 2920 KB Output is correct
9 Correct 179 ms 3388 KB Output is correct
10 Correct 163 ms 3388 KB Output is correct

Subtask #4
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2404 KB Output is correct
2 Incorrect 0 ms 2404 KB Output isn't correct
3 Halted 0 ms 0 KB -