oj.uz

Submission #202504

# Submission time Handle Problem Language Result Execution time Memory
202504 2020-02-16T15:05:57 Z Nucleist Toys (CEOI18_toy) C++14
59 / 100
 5000 ms 83908 KB 
#include <bits/stdc++.h> 
using namespace std; 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
map<vector<dos>,ll>dp;
set<ll>ans;
void solve(vedos k)
{
    dp[k]=1;
    ll last=-1;
    ll newi=0;
    ll comp=0;
    for(auto it:k)
    {
        newi+=((it.first-1)*it.second);
    }
    if(newi>0)ans.insert(newi);
    //if(k.size()<=1)return;
    for (ll i = 0; i < k.size(); ++i)
    {
        for (ll j = i; j < k.size(); ++j)
        {
            vedos next;
            if(i!=j || k[i].second>1)
            {
            next.pb({k[i].first*k[j].first,1});
            for (ll yo = 0; yo < k.size(); ++yo)
            {
                if(yo!=i && yo!=j && k[yo].first!=k[i].first*k[j].first)next.pb(k[yo]);
                else if(k[yo].first==k[i].first*k[j].first)next[0].second+=k[yo].second;
                else if(yo==i && i==j && k[yo].second-2>0)next.pb({k[yo].first,k[yo].second-2});
                else if((yo==i || yo==j) && i!=j && k[yo].second-1>0)next.pb({k[yo].first,k[yo].second-1});
            }
            sort(next.begin(),next.end());
            if(dp.find(next)==dp.end())solve(next);
            }
        }
    }
}
int main()
{
    flash;
    ll n;
    cin>>n;
    ll kol = n;
    vedos primi;
    int comp=0;
    while (n % 2 == 0)  
    {  
        n = n/2; 
        comp++; 
    } 
    if(comp>0)primi.pb({2,comp});
    comp=0;
    for (ll i = 3; i <= sqrt(n); i = i + 2)  
    {  

        while (n % i == 0)  
        {  
            n = n/i; 
            comp++; 
        }  
        if(comp>0)primi.pb({i,comp});
        comp=0;
    }  
  if (n > 2)  
    primi.pb({n,1});
  solve(primi);
  ans.insert(kol-1);
  cout<<ans.size()<<'\n';
  for(auto it:ans)cout<<it<<" ";
  return 0;
}
//code the AC sol !
// BS/queue/map

Compilation message

toy.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
toy.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
 
toy.cpp: In function 'void solve(std::vector<std::pair<long long int, long long int> >)':
toy.cpp:38:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (ll i = 0; i < k.size(); ++i)
                    ~~^~~~~~~~~~
toy.cpp:40:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (ll j = i; j < k.size(); ++j)
                        ~~^~~~~~~~~~
toy.cpp:46:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (ll yo = 0; yo < k.size(); ++yo)
                             ~~~^~~~~~~~~~
toy.cpp:29:8: warning: unused variable 'last' [-Wunused-variable]
     ll last=-1;
        ^~~~
toy.cpp:31:8: warning: unused variable 'comp' [-Wunused-variable]
     ll comp=0;
        ^~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 380 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 6 ms 504 KB Output is correct
25 Correct 5 ms 376 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 380 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 6 ms 504 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 6 ms 504 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 6 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 380 KB Output is correct
37 Correct 8 ms 376 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 5 ms 376 KB Output is correct
40 Correct 5 ms 376 KB Output is correct
41 Correct 4 ms 376 KB Output is correct
42 Correct 5 ms 376 KB Output is correct
43 Correct 6 ms 376 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 5 ms 376 KB Output is correct
46 Correct 5 ms 376 KB Output is correct
47 Correct 5 ms 380 KB Output is correct
48 Correct 5 ms 372 KB Output is correct
49 Correct 5 ms 376 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 380 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 6 ms 504 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 6 ms 504 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 6 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 380 KB Output is correct
37 Correct 8 ms 376 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 5 ms 376 KB Output is correct
40 Correct 5 ms 376 KB Output is correct
41 Correct 4 ms 376 KB Output is correct
42 Correct 5 ms 376 KB Output is correct
43 Correct 6 ms 376 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 5 ms 376 KB Output is correct
46 Correct 5 ms 376 KB Output is correct
47 Correct 5 ms 380 KB Output is correct
48 Correct 5 ms 372 KB Output is correct
49 Correct 5 ms 376 KB Output is correct
50 Correct 11 ms 760 KB Output is correct
51 Correct 11 ms 632 KB Output is correct
52 Correct 12 ms 760 KB Output is correct
53 Correct 11 ms 632 KB Output is correct
54 Correct 8 ms 632 KB Output is correct
55 Correct 19 ms 1016 KB Output is correct
56 Correct 20 ms 888 KB Output is correct
57 Correct 14 ms 888 KB Output is correct
58 Correct 5 ms 376 KB Output is correct
59 Correct 4 ms 376 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 10 ms 632 KB Output is correct
62 Correct 6 ms 504 KB Output is correct
63 Correct 6 ms 376 KB Output is correct
64 Correct 5 ms 376 KB Output is correct
65 Correct 10 ms 632 KB Output is correct
66 Correct 5 ms 256 KB Output is correct
67 Correct 5 ms 376 KB Output is correct
68 Correct 5 ms 248 KB Output is correct
69 Correct 5 ms 376 KB Output is correct
70 Correct 6 ms 376 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 380 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 6 ms 504 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 6 ms 504 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 6 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 380 KB Output is correct
37 Correct 8 ms 376 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 5 ms 376 KB Output is correct
40 Correct 5 ms 376 KB Output is correct
41 Correct 4 ms 376 KB Output is correct
42 Correct 5 ms 376 KB Output is correct
43 Correct 6 ms 376 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 5 ms 376 KB Output is correct
46 Correct 5 ms 376 KB Output is correct
47 Correct 5 ms 380 KB Output is correct
48 Correct 5 ms 372 KB Output is correct
49 Correct 5 ms 376 KB Output is correct
50 Correct 11 ms 760 KB Output is correct
51 Correct 11 ms 632 KB Output is correct
52 Correct 12 ms 760 KB Output is correct
53 Correct 11 ms 632 KB Output is correct
54 Correct 8 ms 632 KB Output is correct
55 Correct 19 ms 1016 KB Output is correct
56 Correct 20 ms 888 KB Output is correct
57 Correct 14 ms 888 KB Output is correct
58 Correct 5 ms 376 KB Output is correct
59 Correct 4 ms 376 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 10 ms 632 KB Output is correct
62 Correct 6 ms 504 KB Output is correct
63 Correct 6 ms 376 KB Output is correct
64 Correct 5 ms 376 KB Output is correct
65 Correct 10 ms 632 KB Output is correct
66 Correct 5 ms 256 KB Output is correct
67 Correct 5 ms 376 KB Output is correct
68 Correct 5 ms 248 KB Output is correct
69 Correct 5 ms 376 KB Output is correct
70 Correct 6 ms 376 KB Output is correct
71 Correct 2709 ms 50536 KB Output is correct
72 Correct 1442 ms 30936 KB Output is correct
73 Correct 3476 ms 61112 KB Output is correct
74 Correct 1025 ms 23672 KB Output is correct
75 Correct 1677 ms 34512 KB Output is correct
76 Execution timed out 5078 ms 83908 KB Time limit exceeded
77 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 380 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 6 ms 504 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 6 ms 504 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 6 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 380 KB Output is correct
37 Correct 8 ms 376 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 5 ms 376 KB Output is correct
40 Correct 5 ms 376 KB Output is correct
41 Correct 4 ms 376 KB Output is correct
42 Correct 5 ms 376 KB Output is correct
43 Correct 6 ms 376 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 5 ms 376 KB Output is correct
46 Correct 5 ms 376 KB Output is correct
47 Correct 5 ms 380 KB Output is correct
48 Correct 5 ms 372 KB Output is correct
49 Correct 5 ms 376 KB Output is correct
50 Correct 11 ms 760 KB Output is correct
51 Correct 11 ms 632 KB Output is correct
52 Correct 12 ms 760 KB Output is correct
53 Correct 11 ms 632 KB Output is correct
54 Correct 8 ms 632 KB Output is correct
55 Correct 19 ms 1016 KB Output is correct
56 Correct 20 ms 888 KB Output is correct
57 Correct 14 ms 888 KB Output is correct
58 Correct 5 ms 376 KB Output is correct
59 Correct 4 ms 376 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 10 ms 632 KB Output is correct
62 Correct 6 ms 504 KB Output is correct
63 Correct 6 ms 376 KB Output is correct
64 Correct 5 ms 376 KB Output is correct
65 Correct 10 ms 632 KB Output is correct
66 Correct 5 ms 256 KB Output is correct
67 Correct 5 ms 376 KB Output is correct
68 Correct 5 ms 248 KB Output is correct
69 Correct 5 ms 376 KB Output is correct
70 Correct 6 ms 376 KB Output is correct
71 Correct 2709 ms 50536 KB Output is correct
72 Correct 1442 ms 30936 KB Output is correct
73 Correct 3476 ms 61112 KB Output is correct
74 Correct 1025 ms 23672 KB Output is correct
75 Correct 1677 ms 34512 KB Output is correct
76 Execution timed out 5078 ms 83908 KB Time limit exceeded
77 Halted 0 ms 0 KB -