oj.uz

Submission #291621

# Submission time Handle Problem Language Result Execution time Memory
291621 2020-09-05T14:47:11 Z NaimSS Toys (CEOI18_toy) C++14
59 / 100
 5000 ms 31840 KB 
#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) (int)v.size()
#define int long long
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
#define left sefude
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl; 
typedef long long ll;
typedef pair<int,int> pii;
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll a,ll b,ll m){
    if(b==0LL) return 1LL;
    if(b==1LL) return mod(a,m);
    ll k = mod(exp(a,b/2,m),m);
    if(b&1LL){
        return mod(a*mod(k*k,m),m);
    }
    else return mod(k*k,m);
}


map<int,bool> ok;
map<pii,bool> vis;
vi usefull;
void go(int n,int sum){
  if(vis[pii(n,sum)])return;
  vis[pii(n,sum)] = 1;
  if(n == 1){ok[sum] = 1;return;}
  for(int i : usefull){
    if(i > n)break;
    if(n%i == 0)go(n/i,sum + i - 1);
  }
  return;
}
map<int,int> used;
void divi(int n){
  for(int i=1;i*i<=n;i++){
    if(n%i==0){
      if(i!=1)usefull.pb(i);
      if(i!=1)used[i] = 1;
      if(n/i!=i)used[n/i]=1;
      if(n/i!=i)usefull.pb(n/i);
    }
  }
}
int32_t main(){
  fastio;
  int n;
  cin >> n;

  divi(n);
  sort(all(usefull));
  //for(n=1;n<=50;n++){

  //go(n,0);

  vis[{1,0}] = 1;

  for(int i : usefull){
    map<pii,bool> save = vis;
    for(auto it : vis){
      if(used[it.ff.ff * i]){
    
        vis[{it.ff.ff * i,it.ff.ss + i-1}] = 1;
      }
    }

  }
  for(auto it : vis){
    if(it.ff.ff == n)ok[it.ff.ss]=1;
  }


  int cnt=0;
  //  cout << n <<": ";
    //cout << cnt << " - "<<divi(n) << endl;
    cout << sz(ok) << endl;
    for(auto it : ok){
      cout << it.ff <<" ";
    }

    cout << endl;
 // }

  // math -> gcd it all
  // Did u check N=1? Did you switch N,M?
}

Compilation message

toy.cpp: In function 'int32_t main()':
toy.cpp:92:7: warning: unused variable 'cnt' [-Wunused-variable]
   92 |   int cnt=0;
      |       ^~~

Subtask #1
19.0 / 19.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 7 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 3 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 288 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 0 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 2 ms 512 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 52 ms 1144 KB Output is correct
51 Correct 40 ms 1024 KB Output is correct
52 Correct 37 ms 1024 KB Output is correct
53 Correct 31 ms 1016 KB Output is correct
54 Correct 18 ms 768 KB Output is correct
55 Correct 62 ms 1400 KB Output is correct
56 Correct 49 ms 1280 KB Output is correct
57 Correct 51 ms 1272 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 512 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 13 ms 896 KB Output is correct
62 Correct 12 ms 640 KB Output is correct
63 Correct 3 ms 512 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 17 ms 896 KB Output is correct
66 Correct 0 ms 384 KB Output is correct
67 Correct 1 ms 384 KB Output is correct
68 Correct 1 ms 384 KB Output is correct
69 Correct 2 ms 384 KB Output is correct
70 Correct 13 ms 640 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 7 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 3 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 288 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 0 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 2 ms 512 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 52 ms 1144 KB Output is correct
51 Correct 40 ms 1024 KB Output is correct
52 Correct 37 ms 1024 KB Output is correct
53 Correct 31 ms 1016 KB Output is correct
54 Correct 18 ms 768 KB Output is correct
55 Correct 62 ms 1400 KB Output is correct
56 Correct 49 ms 1280 KB Output is correct
57 Correct 51 ms 1272 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 512 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 13 ms 896 KB Output is correct
62 Correct 12 ms 640 KB Output is correct
63 Correct 3 ms 512 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 17 ms 896 KB Output is correct
66 Correct 0 ms 384 KB Output is correct
67 Correct 1 ms 384 KB Output is correct
68 Correct 1 ms 384 KB Output is correct
69 Correct 2 ms 384 KB Output is correct
70 Correct 13 ms 640 KB Output is correct
71 Execution timed out 5070 ms 31840 KB Time limit exceeded
72 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 7 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 3 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 288 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 0 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 2 ms 512 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 52 ms 1144 KB Output is correct
51 Correct 40 ms 1024 KB Output is correct
52 Correct 37 ms 1024 KB Output is correct
53 Correct 31 ms 1016 KB Output is correct
54 Correct 18 ms 768 KB Output is correct
55 Correct 62 ms 1400 KB Output is correct
56 Correct 49 ms 1280 KB Output is correct
57 Correct 51 ms 1272 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 512 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 13 ms 896 KB Output is correct
62 Correct 12 ms 640 KB Output is correct
63 Correct 3 ms 512 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 17 ms 896 KB Output is correct
66 Correct 0 ms 384 KB Output is correct
67 Correct 1 ms 384 KB Output is correct
68 Correct 1 ms 384 KB Output is correct
69 Correct 2 ms 384 KB Output is correct
70 Correct 13 ms 640 KB Output is correct
71 Execution timed out 5070 ms 31840 KB Time limit exceeded
72 Halted 0 ms 0 KB -