| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 942871 | 2024-03-11T05:48:10 Z | vjudge1 | Toys (CEOI18_toy) | C++17 | 1 ms | 860 KB |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
using namespace std;
void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 505, mxc = 105, inf = 1e18, MX = 1e5 + 10;
int was[N][N];
main(){
iostream::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector <int> d;
for(int i = 1; i <= n; i++){
if(n % i != 0)continue;
d.pb(i);
}
was[1][0] = 1;
set <int> ans;
for(int i = 0;i <= 25; i++){
for(int j = 1; j <= n; j++){
for(auto x : d){
if(x * j > n)break;
if(!was[j][i])continue;
was[j * x][i + x - 1]++;
if(j * x == n)ans.insert(i + x - 1);
}
}
}
cout << ans.size() << endl;
for(auto x : ans)
cout << x <<" ";
}
/*
* Before implementing the problem:
Do I understand the problem correctly?
Which places are tricky? What do I need to remember to implement them correctly?
Which place is the heaviest by implementation? Can I do it simpler?
Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
----------------------------------
If not AC:
Did you remember to do everything to handle the tricky places you thought about before?
Is the solution correct?
Do I understand the problem correctly?
----------------------------------
If you have a test on which the solution gives wrong answer:
Is the solution doing what it was supposed to do?
Is the problem in the code or in the idea?
*/
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 348 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 344 KB | Output is correct |
| 4 | Correct | 0 ms | 348 KB | Output is correct |
| 5 | Correct | 0 ms | 348 KB | Output is correct |
| 6 | Correct | 0 ms | 348 KB | Output is correct |
| 7 | Correct | 0 ms | 348 KB | Output is correct |
| 8 | Correct | 0 ms | 348 KB | Output is correct |
| 9 | Correct | 1 ms | 344 KB | Output is correct |
| 10 | Correct | 0 ms | 348 KB | Output is correct |
| 11 | Correct | 1 ms | 348 KB | Output is correct |
| 12 | Correct | 1 ms | 344 KB | Output is correct |
| 13 | Correct | 0 ms | 348 KB | Output is correct |
| 14 | Correct | 0 ms | 348 KB | Output is correct |
| 15 | Correct | 0 ms | 344 KB | Output is correct |
| 16 | Correct | 0 ms | 344 KB | Output is correct |
| 17 | Correct | 1 ms | 344 KB | Output is correct |
| 18 | Correct | 0 ms | 344 KB | Output is correct |
| 19 | Correct | 1 ms | 348 KB | Output is correct |
| 20 | Correct | 0 ms | 348 KB | Output is correct |
| 21 | Correct | 1 ms | 348 KB | Output is correct |
| 22 | Correct | 0 ms | 348 KB | Output is correct |
| 23 | Correct | 0 ms | 348 KB | Output is correct |
| 24 | Correct | 0 ms | 348 KB | Output is correct |
| 25 | Correct | 1 ms | 348 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 348 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 344 KB | Output is correct |
| 4 | Correct | 0 ms | 348 KB | Output is correct |
| 5 | Correct | 0 ms | 348 KB | Output is correct |
| 6 | Correct | 0 ms | 348 KB | Output is correct |
| 7 | Correct | 0 ms | 348 KB | Output is correct |
| 8 | Correct | 0 ms | 348 KB | Output is correct |
| 9 | Correct | 1 ms | 344 KB | Output is correct |
| 10 | Correct | 0 ms | 348 KB | Output is correct |
| 11 | Correct | 1 ms | 348 KB | Output is correct |
| 12 | Correct | 1 ms | 344 KB | Output is correct |
| 13 | Correct | 0 ms | 348 KB | Output is correct |
| 14 | Correct | 0 ms | 348 KB | Output is correct |
| 15 | Correct | 0 ms | 344 KB | Output is correct |
| 16 | Correct | 0 ms | 344 KB | Output is correct |
| 17 | Correct | 1 ms | 344 KB | Output is correct |
| 18 | Correct | 0 ms | 344 KB | Output is correct |
| 19 | Correct | 1 ms | 348 KB | Output is correct |
| 20 | Correct | 0 ms | 348 KB | Output is correct |
| 21 | Correct | 1 ms | 348 KB | Output is correct |
| 22 | Correct | 0 ms | 348 KB | Output is correct |
| 23 | Correct | 0 ms | 348 KB | Output is correct |
| 24 | Correct | 0 ms | 348 KB | Output is correct |
| 25 | Correct | 1 ms | 348 KB | Output is correct |
| 26 | Runtime error | 1 ms | 860 KB | Execution killed with signal 11 |
| 27 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 348 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 344 KB | Output is correct |
| 4 | Correct | 0 ms | 348 KB | Output is correct |
| 5 | Correct | 0 ms | 348 KB | Output is correct |
| 6 | Correct | 0 ms | 348 KB | Output is correct |
| 7 | Correct | 0 ms | 348 KB | Output is correct |
| 8 | Correct | 0 ms | 348 KB | Output is correct |
| 9 | Correct | 1 ms | 344 KB | Output is correct |
| 10 | Correct | 0 ms | 348 KB | Output is correct |
| 11 | Correct | 1 ms | 348 KB | Output is correct |
| 12 | Correct | 1 ms | 344 KB | Output is correct |
| 13 | Correct | 0 ms | 348 KB | Output is correct |
| 14 | Correct | 0 ms | 348 KB | Output is correct |
| 15 | Correct | 0 ms | 344 KB | Output is correct |
| 16 | Correct | 0 ms | 344 KB | Output is correct |
| 17 | Correct | 1 ms | 344 KB | Output is correct |
| 18 | Correct | 0 ms | 344 KB | Output is correct |
| 19 | Correct | 1 ms | 348 KB | Output is correct |
| 20 | Correct | 0 ms | 348 KB | Output is correct |
| 21 | Correct | 1 ms | 348 KB | Output is correct |
| 22 | Correct | 0 ms | 348 KB | Output is correct |
| 23 | Correct | 0 ms | 348 KB | Output is correct |
| 24 | Correct | 0 ms | 348 KB | Output is correct |
| 25 | Correct | 1 ms | 348 KB | Output is correct |
| 26 | Runtime error | 1 ms | 860 KB | Execution killed with signal 11 |
| 27 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 348 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 344 KB | Output is correct |
| 4 | Correct | 0 ms | 348 KB | Output is correct |
| 5 | Correct | 0 ms | 348 KB | Output is correct |
| 6 | Correct | 0 ms | 348 KB | Output is correct |
| 7 | Correct | 0 ms | 348 KB | Output is correct |
| 8 | Correct | 0 ms | 348 KB | Output is correct |
| 9 | Correct | 1 ms | 344 KB | Output is correct |
| 10 | Correct | 0 ms | 348 KB | Output is correct |
| 11 | Correct | 1 ms | 348 KB | Output is correct |
| 12 | Correct | 1 ms | 344 KB | Output is correct |
| 13 | Correct | 0 ms | 348 KB | Output is correct |
| 14 | Correct | 0 ms | 348 KB | Output is correct |
| 15 | Correct | 0 ms | 344 KB | Output is correct |
| 16 | Correct | 0 ms | 344 KB | Output is correct |
| 17 | Correct | 1 ms | 344 KB | Output is correct |
| 18 | Correct | 0 ms | 344 KB | Output is correct |
| 19 | Correct | 1 ms | 348 KB | Output is correct |
| 20 | Correct | 0 ms | 348 KB | Output is correct |
| 21 | Correct | 1 ms | 348 KB | Output is correct |
| 22 | Correct | 0 ms | 348 KB | Output is correct |
| 23 | Correct | 0 ms | 348 KB | Output is correct |
| 24 | Correct | 0 ms | 348 KB | Output is correct |
| 25 | Correct | 1 ms | 348 KB | Output is correct |
| 26 | Runtime error | 1 ms | 860 KB | Execution killed with signal 11 |
| 27 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 348 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 344 KB | Output is correct |
| 4 | Correct | 0 ms | 348 KB | Output is correct |
| 5 | Correct | 0 ms | 348 KB | Output is correct |
| 6 | Correct | 0 ms | 348 KB | Output is correct |
| 7 | Correct | 0 ms | 348 KB | Output is correct |
| 8 | Correct | 0 ms | 348 KB | Output is correct |
| 9 | Correct | 1 ms | 344 KB | Output is correct |
| 10 | Correct | 0 ms | 348 KB | Output is correct |
| 11 | Correct | 1 ms | 348 KB | Output is correct |
| 12 | Correct | 1 ms | 344 KB | Output is correct |
| 13 | Correct | 0 ms | 348 KB | Output is correct |
| 14 | Correct | 0 ms | 348 KB | Output is correct |
| 15 | Correct | 0 ms | 344 KB | Output is correct |
| 16 | Correct | 0 ms | 344 KB | Output is correct |
| 17 | Correct | 1 ms | 344 KB | Output is correct |
| 18 | Correct | 0 ms | 344 KB | Output is correct |
| 19 | Correct | 1 ms | 348 KB | Output is correct |
| 20 | Correct | 0 ms | 348 KB | Output is correct |
| 21 | Correct | 1 ms | 348 KB | Output is correct |
| 22 | Correct | 0 ms | 348 KB | Output is correct |
| 23 | Correct | 0 ms | 348 KB | Output is correct |
| 24 | Correct | 0 ms | 348 KB | Output is correct |
| 25 | Correct | 1 ms | 348 KB | Output is correct |
| 26 | Runtime error | 1 ms | 860 KB | Execution killed with signal 11 |
| 27 | Halted | 0 ms | 0 KB | - |