# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
393231 | nikatamliani | Toys (CEOI18_toy) | C++14 | 5056 ms | 75228 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
using namespace std;
const int N = 1e5+10;
unordered_set<int> dp[N];
int n;
vector<int> ds;
map<int, int> id;
void relax(int x) {
int me = id[x];
for(int i = 0; i < (int)ds.size(); ++i) {
if(n % ((long long)ds[i] * x) == 0) {
int he = id[ds[i] * x];
for(int p : dp[i]) {
for(int q : dp[me]) {
dp[he].insert(p + q);
}
}
}
}
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> n;
for(int i = 1; i * i <= n; ++i) {
if(n % i == 0) {
ds.push_back(i);
if(i * i < n) ds.push_back(n / i);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |