제출 #357875

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
357875		MetB	Sirni (COCI17_sirni)	C++14	84 / 140	5093 ms	786436 KiB

sirni

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace __gnu_pbds;
 
using namespace std;
 
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
 
const ll N = 2000001;
const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3;
const int maxa = (int)1e7 + 1;
int a[N], n;

int best[maxa], p[N], sz[N], e[maxa];

vector<pair<int, int>> v[maxa + 1];

int f(int i, int j) {
	if (a[i] > a[j]) swap(i, j);
	return a[j] % a[i];
}

int find(int x) {
	if (p[x] == x) return x;
	return p[x] = find(p[x]);
}

bool unite(int a, int b) {
	a = find(a), b = find(b);
	if (a == b) return false;

	if (sz[a] < sz[b]) swap(a, b);

	sz[a] += sz[b];
	p[b] = a;

	return true;
}

int main() {

	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> n;

	fill(e, e + maxa + 1, -1);

	for (int i = 0; i < n; i++) {
		sz[i] = 1, p[i] = i;
	}

	for (int i = 0; i < n; i++) {
		cin >> a[i];
		e[a[i]] = i;
	}

	for (int i = maxa - 1; i >= 0; i--) {
		if (e[i] == -1) e[i] = e[i+1];
	}

	for (int i = 0; i < n; i++) {
		if (e[a[i]] != i) v[0].push_back({i, e[a[i]]});
		if (e[a[i] + 1] != -1) {
			v[f(i, e[a[i] + 1])].push_back({i, e[a[i] + 1]});
		}
		for (int k = 2; k * a[i] < maxa; k++) {
			if (e[k * a[i]] != -1) {
				v[f(i, e[k * a[i]])].push_back({i, e[k * a[i]]});
			}
		}
	}

	ll ans = 0;

	for (int i = 0; i <= maxa; i++) {
		for (auto& x : v[i]) {
			if (unite(x.first, x.second)) {
				ans += f(x.first, x.second);
				//cout << a[x.first] << ' ' << a[x.second] << ' ' << f(x.first, x.second) << endl;
			}
		}	
	}

	cout << ans;

}

컴파일 시 표준 에러 (stderr) 메시지

sirni.cpp: In function 'int main()':
sirni.cpp:50:6: warning: array subscript 10000002 is outside array bounds of 'int [10000001]' [-Warray-bounds]
   50 |  fill(e, e + maxa + 1, -1);
      |  ~~~~^~~~~~~~~~~~~~~~~~~~~
sirni.cpp:17:30: note: while referencing 'e'
   17 | int best[maxa], p[N], sz[N], e[maxa];
      |                              ^

• Subtask 1: 14 / 14
• Subtask 2: 0 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 0 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14