oj.uz

답안 #543341

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
543341 2022-03-30T10:17:07 Z eecs Present (RMI21_present) C++17
100 / 100
 1826 ms 4372 KB 
#include <bits/stdc++.h>
using namespace std;

int T, K, lim[1 << 19], mark[38], cnt[1 << 18];
bool ok1[1 << 19], ok2[1 << 18];

int main() {
    for (int i = 0; i < 1 << 19; i++) {
        ok1[i] = 1, lim[i] = (1 << 18) - 1;
        for (int j = 0; j < 19 && ok1[i]; j++) if (i >> j & 1) {
            for (int k = j + 1; k < 19; k++) if (i >> k & 1) {
                ok1[i] &= i >> (__gcd(2 * j + 1, 2 * k + 1) / 2) & 1;
            }
            for (int k = 0; k < 18; k++) {
                if (!(i >> (__gcd(2 * j + 1, 2 * k + 2) / 2) & 1)) lim[i] &= ~(1 << k);
            }
        }
    }
    for (int i = 0; i < 1 << 18; i++) {
        ok2[i] = 1;
        for (int j = 0; j < 18 && ok2[i]; j++) if (i >> j & 1) {
            for (int k = j + 1; k < 18; k++) if (i >> k & 1) {
                ok2[i] &= i >> (__gcd(2 * j + 2, 2 * k + 2) / 2 - 1) & 1;
            }
        }
    }
    auto calc = [&]() {
        copy(ok2, ok2 + (1 << 18), cnt);
        for (int i = 0; i < 1 << 18; i++) {
            for (int j = 0; j < 18 && cnt[i]; j++) {
                if (~mark[2 * j + 2] && mark[2 * j + 2] ^ (i >> j & 1)) cnt[i] = 0;
            }
        }
        for (int i = 1; i < 1 << 18; i <<= 1) {
            for (int j = 0; j < 1 << 18; j += i << 1) {
                for (int k = 0; k < i; k++) cnt[i + j + k] += cnt[j + k];
            }
        }
        long long s = 0;
        for (int i = 0; i < 1 << 19; i++) if (ok1[i]) {
            bool flag = 1;
            for (int j = 0; j < 19 && flag; j++) {
                if (~mark[2 * j + 1] && mark[2 * j + 1] ^ (i >> j & 1)) flag = 0;
            }
            if (flag) s += cnt[lim[i]];
        }
        return s;
    };
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &K), K++;
        memset(mark, -1, sizeof(mark));
        vector<int> res;
        for (int i = 37; i; i--) {
            mark[i] = 0;
            long long t = calc();
            if (t < K) mark[i] = 1, K -= t, res.push_back(i);
        }
        printf("%d", res.size());
        reverse(res.begin(), res.end());
        for (int x : res) printf(" %d", x);
        putchar('\n');
    }
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:59:18: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wformat=]
   59 |         printf("%d", res.size());
      |                 ~^   ~~~~~~~~~~
      |                  |           |
      |                  int         std::vector<int>::size_type {aka long unsigned int}
      |                 %ld
Main.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |     scanf("%d", &T);
      |     ~~~~~^~~~~~~~~~
Main.cpp:51:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         scanf("%d", &K), K++;
      |         ~~~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1798 ms 4044 KB Output is correct
2 Correct 1763 ms 4016 KB Output is correct
3 Correct 1774 ms 4128 KB Output is correct
4 Correct 1759 ms 4128 KB Output is correct
5 Correct 1781 ms 4164 KB Output is correct
6 Correct 1800 ms 4108 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1798 ms 4044 KB Output is correct
2 Correct 1763 ms 4016 KB Output is correct
3 Correct 1774 ms 4128 KB Output is correct
4 Correct 1759 ms 4128 KB Output is correct
5 Correct 1781 ms 4164 KB Output is correct
6 Correct 1800 ms 4108 KB Output is correct
7 Correct 1826 ms 4124 KB Output is correct
8 Correct 1740 ms 4140 KB Output is correct
9 Correct 1765 ms 4252 KB Output is correct
10 Correct 1777 ms 4216 KB Output is correct
11 Correct 1701 ms 4124 KB Output is correct
12 Correct 1700 ms 4132 KB Output is correct

Subtask #3
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1798 ms 4044 KB Output is correct
2 Correct 1763 ms 4016 KB Output is correct
3 Correct 1774 ms 4128 KB Output is correct
4 Correct 1759 ms 4128 KB Output is correct
5 Correct 1781 ms 4164 KB Output is correct
6 Correct 1800 ms 4108 KB Output is correct
7 Correct 1826 ms 4124 KB Output is correct
8 Correct 1740 ms 4140 KB Output is correct
9 Correct 1765 ms 4252 KB Output is correct
10 Correct 1777 ms 4216 KB Output is correct
11 Correct 1701 ms 4124 KB Output is correct
12 Correct 1700 ms 4132 KB Output is correct
13 Correct 1728 ms 4148 KB Output is correct
14 Correct 1671 ms 4124 KB Output is correct
15 Correct 1660 ms 4128 KB Output is correct
16 Correct 1708 ms 4044 KB Output is correct
17 Correct 1606 ms 4308 KB Output is correct
18 Correct 1654 ms 4132 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1798 ms 4044 KB Output is correct
2 Correct 1763 ms 4016 KB Output is correct
3 Correct 1774 ms 4128 KB Output is correct
4 Correct 1759 ms 4128 KB Output is correct
5 Correct 1781 ms 4164 KB Output is correct
6 Correct 1800 ms 4108 KB Output is correct
7 Correct 1826 ms 4124 KB Output is correct
8 Correct 1740 ms 4140 KB Output is correct
9 Correct 1765 ms 4252 KB Output is correct
10 Correct 1777 ms 4216 KB Output is correct
11 Correct 1701 ms 4124 KB Output is correct
12 Correct 1700 ms 4132 KB Output is correct
13 Correct 1728 ms 4148 KB Output is correct
14 Correct 1671 ms 4124 KB Output is correct
15 Correct 1660 ms 4128 KB Output is correct
16 Correct 1708 ms 4044 KB Output is correct
17 Correct 1606 ms 4308 KB Output is correct
18 Correct 1654 ms 4132 KB Output is correct
19 Correct 1659 ms 4372 KB Output is correct
20 Correct 1664 ms 4252 KB Output is correct
21 Correct 1621 ms 4180 KB Output is correct
22 Correct 1643 ms 4348 KB Output is correct
23 Correct 1622 ms 4224 KB Output is correct
24 Correct 1627 ms 4252 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1798 ms 4044 KB Output is correct
2 Correct 1763 ms 4016 KB Output is correct
3 Correct 1774 ms 4128 KB Output is correct
4 Correct 1759 ms 4128 KB Output is correct
5 Correct 1781 ms 4164 KB Output is correct
6 Correct 1800 ms 4108 KB Output is correct
7 Correct 1826 ms 4124 KB Output is correct
8 Correct 1740 ms 4140 KB Output is correct
9 Correct 1765 ms 4252 KB Output is correct
10 Correct 1777 ms 4216 KB Output is correct
11 Correct 1701 ms 4124 KB Output is correct
12 Correct 1700 ms 4132 KB Output is correct
13 Correct 1728 ms 4148 KB Output is correct
14 Correct 1671 ms 4124 KB Output is correct
15 Correct 1660 ms 4128 KB Output is correct
16 Correct 1708 ms 4044 KB Output is correct
17 Correct 1606 ms 4308 KB Output is correct
18 Correct 1654 ms 4132 KB Output is correct
19 Correct 1659 ms 4372 KB Output is correct
20 Correct 1664 ms 4252 KB Output is correct
21 Correct 1621 ms 4180 KB Output is correct
22 Correct 1643 ms 4348 KB Output is correct
23 Correct 1622 ms 4224 KB Output is correct
24 Correct 1627 ms 4252 KB Output is correct
25 Correct 1614 ms 4300 KB Output is correct
26 Correct 1630 ms 4128 KB Output is correct
27 Correct 1629 ms 4236 KB Output is correct
28 Correct 1604 ms 4196 KB Output is correct
29 Correct 1591 ms 4224 KB Output is correct
30 Correct 1628 ms 4304 KB Output is correct