# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
130530 | ffresh | 팔찌 (kriii4_V) | C++17 | 1085 ms | 71928 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 <stdio.h>
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <assert.h>
#include <queue>
#include <string.h>
#include <string>
#include <set>
#include <memory.h>
#include <functional>
#include <bitset>
using namespace std;
#define ll long long
const int mod = 1e9 + 7;
const int N = 1e6 + 2;
vector<int> divisor[N];
int pp[N];
int dp[N], v[N], bit[N];
int getSz(int y) {
int ret = y;
int vv,d = pp[y];
for (int i = 0; i<divisor[d].size(); ++i) {
vv = divisor[d][i];
if (bit[vv]==0) {
vv *= -1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |