Submission #846809


Source Code Expand

Copy
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

vector<int> ps;

ll f3(ll x) {
	for (ll p: ps) {
		ll p3 = (ll)p * p * p;
		while (x % p3 == 0) x /= p3;
	}
	return x;
}

int main() {
	vector<bool> is_p(2201, true);
	is_p[0] = is_p[1] = false;
	for (int i = 2; i <= 2200; i++)
		if (is_p[i]) {
			ps.push_back(i);
			for (int j = i * 2; j <= 2200; j += i)
				is_p[j] = false;
		}
	map<ll, int> mp;
	int N; cin >> N;
	while (N--) {
		ll x; cin >> x;
		mp[f3(x)]++;
	}
	set<ll_ll> st;
	int ans = 0;
	for (ll_i z: mp) {
		ll x = z.first, _x = x, y = 1;
		if (x == 1) {
			ans = 1;
			continue;
		}
		double Y = 1;
		for (int p: ps) {
			if (x % (p * p) == 0) {
				x /= p * p;
				y *= p;
				Y *= p;
			}
			else if (x % p == 0) {
				x /= p;
				y *= p * p;
				Y *= p;
			}
		}
		if (x > 2200 * 2200) continue;
		y *= (ll)x * x;
		Y *= (ll)x * x;
		if (Y < 1e11) {
			if (_x > y) swap(_x, y);
			st.insert(ll_ll(_x, y));
		}
	}
	for (ll_ll z: st) {
		ans += max(mp[z.first], mp[z.second]);
		mp[z.first] = mp[z.second] = 0;
	}
	for (ll_i z: mp) if (z.first != 1) ans += z.second;
	cout << ans << endl;
}

Submission Info

Submission Time
Task D - Anticube
User sugim48
Language C++14 (GCC 5.4.1)
Score 1100
Code Size 1809 Byte
Status AC
Exec Time 1822 ms
Memory 15616 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1100 / 1100
Status
AC × 3
AC × 51
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 1821 ms 7296 KB
02.txt AC 1804 ms 7296 KB
03.txt AC 1805 ms 7296 KB
04.txt AC 1814 ms 7296 KB
05.txt AC 1806 ms 7296 KB
06.txt AC 1814 ms 7296 KB
07.txt AC 1815 ms 7296 KB
08.txt AC 1822 ms 7296 KB
09.txt AC 1806 ms 7296 KB
10.txt AC 1810 ms 7296 KB
11.txt AC 1043 ms 2176 KB
12.txt AC 1030 ms 2176 KB
13.txt AC 1099 ms 5248 KB
14.txt AC 1098 ms 5248 KB
15.txt AC 1100 ms 5248 KB
16.txt AC 1098 ms 5248 KB
17.txt AC 682 ms 256 KB
18.txt AC 682 ms 384 KB
19.txt AC 690 ms 256 KB
20.txt AC 682 ms 256 KB
21.txt AC 1370 ms 5760 KB
22.txt AC 1369 ms 5760 KB
23.txt AC 1377 ms 5760 KB
24.txt AC 1370 ms 5760 KB
25.txt AC 1370 ms 5760 KB
26.txt AC 1410 ms 5760 KB
27.txt AC 1701 ms 15616 KB
28.txt AC 609 ms 256 KB
29.txt AC 608 ms 256 KB
30.txt AC 610 ms 256 KB
31.txt AC 610 ms 256 KB
32.txt AC 614 ms 256 KB
33.txt AC 4 ms 256 KB
34.txt AC 676 ms 256 KB
35.txt AC 671 ms 256 KB
36.txt AC 4 ms 256 KB
37.txt AC 1115 ms 3072 KB
38.txt AC 1114 ms 3072 KB
39.txt AC 1113 ms 3072 KB
40.txt AC 1119 ms 3072 KB
41.txt AC 4 ms 256 KB
42.txt AC 4 ms 256 KB
43.txt AC 4 ms 256 KB
44.txt AC 4 ms 256 KB
45.txt AC 4 ms 256 KB
46.txt AC 4 ms 256 KB
47.txt AC 4 ms 256 KB
48.txt AC 4 ms 256 KB
s1.txt AC 4 ms 256 KB
s2.txt AC 4 ms 256 KB
s3.txt AC 4 ms 256 KB