oj.uz

답안 #385746

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
385746 2021-04-04T21:04:49 Z mohamedsobhi777 Toys (CEOI18_toy) C++14
59 / 100
 5000 ms 1636 KB 
#include <bits/stdc++.h>

using namespace std;

#define vi vector<int>
#define vll vector<ll>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define loop(_) for (int __ = 0; __ < (_); ++__)
#define pb push_back
#define f first
#define s second
#define sz(_) ((int)_.size())
#define all(_) _.begin(), _.end()
#define lb lower_bound
#define ub upper_bound

using ll = long long;
using ld = long double;

const int N = 1e5 + 7;
const ll mod = 1e9 + 7;

int n;
set<int> ans;
vi prm;

vi facto(int x)
{
       vi ret;
       for (int i = 2; i * i <= x; ++i)
       {
              while (x % i == 0)
              {
                     ret.pb(i);
                     x /= i;
              }
       }
       if (x > 1)
              ret.pb(x);
       return ret;
}

int sum;
int tkn = 0;

void backtrack()
{
       if (tkn == (1 << sz(prm)) - 1)
       {
              ans.insert(sum);
              return;
       }
       int ntkn = (tkn ^ ((1 << sz(prm)) - 1));
       for (int i = ntkn; i; i = (i - 1) & ntkn)
       {
              // if ((tkn & i))
              // continue;
              int asum = 1;
              bool flag = 0;
              for (int j = 0; j < sz(prm); ++j)
              {
                     if (i & (1 << j))
                     {
                            asum *= prm[j];
                            auto got = [&](int u, int z) -> bool {
                                   return (u & (1 << z)) > 0;
                            };
                            if (j && prm[j] == prm[j - 1] && !got(tkn, j - 1) && !got(i, j - 1))
                            {
                                   flag = 1;
                                   break;
                            }
                     }
              }
              if (flag)
                     continue;
              sum += asum - 1;
              int omask = tkn;
              tkn |= i;
              backtrack();
              tkn = omask;
              sum -= asum - 1;
       }
}

vii prep(vi x)
{
       vii ret;
       int z = sz(x);
       for (int i = 0; i < (1 << z); ++i)
       {
              int mul = 1;
              for (int j = 0; j < z; ++j)
              {
                     if (i & (1 << j))
                     {
                            mul *= x[j];
                     }
              }
              ret.pb({__builtin_popcount(i), mul});
       }

       return ret;
}

int main()
{
       ios_base::sync_with_stdio(0);
       cin.tie(0);
#ifndef ONLINE_JUDGE
#endif
       cin >> n;
       prm = facto(n);
       sort(all(prm));
       vi lhs, rhs;

       for (int i = 0; i < sz(prm); ++i)
       {
              if (i < sz(prm) / 2)
                     lhs.pb(prm[i]);
              else
                     rhs.pb(prm[i]);
       }
       // vii LHS = prep(lhs), RHS = prep(rhs);
       // for(int auto u : LHS){
       //        for(auto u2:RHS){

       //        }
       // }
       backtrack();
       cout << sz(ans) << "\n";
       for (auto u : ans)
       {
              cout << u << " ";
       }
       return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 4 ms 364 KB Output is correct
27 Correct 4 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 10 ms 364 KB Output is correct
32 Correct 6 ms 364 KB Output is correct
33 Correct 4 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 2 ms 364 KB Output is correct
37 Correct 4 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 2 ms 364 KB Output is correct
40 Correct 3 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 3 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 4 ms 364 KB Output is correct
27 Correct 4 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 10 ms 364 KB Output is correct
32 Correct 6 ms 364 KB Output is correct
33 Correct 4 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 2 ms 364 KB Output is correct
37 Correct 4 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 2 ms 364 KB Output is correct
40 Correct 3 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 3 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 34 ms 364 KB Output is correct
51 Correct 27 ms 364 KB Output is correct
52 Correct 55 ms 364 KB Output is correct
53 Correct 45 ms 364 KB Output is correct
54 Correct 8 ms 364 KB Output is correct
55 Correct 178 ms 364 KB Output is correct
56 Correct 213 ms 492 KB Output is correct
57 Correct 77 ms 492 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 2 ms 364 KB Output is correct
60 Correct 15 ms 492 KB Output is correct
61 Correct 126 ms 420 KB Output is correct
62 Correct 8 ms 364 KB Output is correct
63 Correct 5 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 26 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 4 ms 364 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 4 ms 364 KB Output is correct
27 Correct 4 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 10 ms 364 KB Output is correct
32 Correct 6 ms 364 KB Output is correct
33 Correct 4 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 2 ms 364 KB Output is correct
37 Correct 4 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 2 ms 364 KB Output is correct
40 Correct 3 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 3 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 34 ms 364 KB Output is correct
51 Correct 27 ms 364 KB Output is correct
52 Correct 55 ms 364 KB Output is correct
53 Correct 45 ms 364 KB Output is correct
54 Correct 8 ms 364 KB Output is correct
55 Correct 178 ms 364 KB Output is correct
56 Correct 213 ms 492 KB Output is correct
57 Correct 77 ms 492 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 2 ms 364 KB Output is correct
60 Correct 15 ms 492 KB Output is correct
61 Correct 126 ms 420 KB Output is correct
62 Correct 8 ms 364 KB Output is correct
63 Correct 5 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 26 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 4 ms 364 KB Output is correct
71 Execution timed out 5056 ms 1636 KB Time limit exceeded
72 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 4 ms 364 KB Output is correct
27 Correct 4 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 10 ms 364 KB Output is correct
32 Correct 6 ms 364 KB Output is correct
33 Correct 4 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 2 ms 364 KB Output is correct
37 Correct 4 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 2 ms 364 KB Output is correct
40 Correct 3 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 3 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 34 ms 364 KB Output is correct
51 Correct 27 ms 364 KB Output is correct
52 Correct 55 ms 364 KB Output is correct
53 Correct 45 ms 364 KB Output is correct
54 Correct 8 ms 364 KB Output is correct
55 Correct 178 ms 364 KB Output is correct
56 Correct 213 ms 492 KB Output is correct
57 Correct 77 ms 492 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 2 ms 364 KB Output is correct
60 Correct 15 ms 492 KB Output is correct
61 Correct 126 ms 420 KB Output is correct
62 Correct 8 ms 364 KB Output is correct
63 Correct 5 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 26 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 4 ms 364 KB Output is correct
71 Execution timed out 5056 ms 1636 KB Time limit exceeded
72 Halted 0 ms 0 KB -