# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
493229 | blue | Toys (CEOI18_toy) | C++17 | 5064 ms | 65772 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 <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <map>
using namespace std;
#define sz(x) (int(x.size()))
using vi = vector<int>;
// map< int, vector<int> > res;
vi sf;
long long n;
vector<int> res[40'000]; //i*i <= n
vector<int> res2[40'000]; //i*i >= n, access n/i.
vi solved(1+40'000, 0);
vi solved2(1+40'000, 0);
void solve(long long i)
{
// cerr << "solve " << i << '\n';
// if(solved[i]) return;
// solved[i] = 1;
if(i*i <= n)
{
if(solved[i]) return;
# | 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... |