oj.uz

답안 #1021181

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1021181 2024-07-12T15:16:05 Z pan Sirni (COCI17_sirni) C++17
98 / 140
 1743 ms 786432 KB 
#include <bits/stdc++.h>
//#include "bits_stdc++.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%d", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef int ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> piii;

ll p;
vector<ll> dis;
vector<pii> edges;
bool compare(pii a , pii b)
{
	return a.s < b.s;
}

ll par[100005];
ll find(ll x) {return ((x==par[x])?x:par[x] = find(par[x]));}
void unite(ll x, ll y) {if ((x=find(x)) != (y=find(y))) par[x] = y;}

int main()
{
	ll n;
	long long ans = 0;
	input(n);
	for (ll i=0; i<n; ++i) {input(p); dis.pb(p);}
	discretize(dis);
	for (ll i=0; i<dis.size(); ++i)
	{
		ll last = -1;
		for (ll j=0; j<=dis.back(); j+=dis[i])
		{
			ll nxt = lb(all(dis), j)-dis.begin();
			if (nxt == last) continue;
			edges.pb(mp(mp(i, nxt),  min(dis[i]%dis[nxt], dis[nxt]%dis[i])));
			if (nxt > 0 ) edges.pb(mp(mp(i, nxt-1),  min(dis[i]%dis[nxt-1], dis[nxt-1]%dis[i])));
			last = nxt;
		}
	}
	sort(all(edges), compare);
	for (ll i=0; i<dis.size(); ++i) par[i] = i;
	for (pii u: edges)
	{
		if (find(u.f.f)==find(u.f.s)) continue;
		ans += ll(u.s);
		unite(u.f.f, u.f.s);
	}
	print(ans, '\n');
	
	
	return 0;
}

Compilation message

sirni.cpp: In function 'int main()':
sirni.cpp:56:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |  for (ll i=0; i<dis.size(); ++i)
      |               ~^~~~~~~~~~~
sirni.cpp:69:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |  for (ll i=0; i<dis.size(); ++i) par[i] = i;
      |               ~^~~~~~~~~~~
sirni.cpp:12:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | #define input(x) scanf("%d", &x);
      |                  ~~~~~^~~~~~~~~~
sirni.cpp:53:2: note: in expansion of macro 'input'
   53 |  input(n);
      |  ^~~~~
sirni.cpp:12:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | #define input(x) scanf("%d", &x);
      |                  ~~~~~^~~~~~~~~~
sirni.cpp:54:26: note: in expansion of macro 'input'
   54 |  for (ll i=0; i<n; ++i) {input(p); dis.pb(p);}
      |                          ^~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 64 ms 6604 KB Output is correct
3 Correct 4 ms 856 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 386 ms 1892 KB Output is correct
3 Correct 4 ms 852 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 800 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 304 ms 50952 KB Output is correct
2 Correct 1034 ms 100312 KB Output is correct
3 Correct 389 ms 50952 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 6908 KB Output is correct
2 Correct 503 ms 100056 KB Output is correct
3 Correct 274 ms 51024 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 600 ms 100200 KB Output is correct
2 Correct 1326 ms 198652 KB Output is correct
3 Correct 352 ms 50952 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 13104 KB Output is correct
2 Correct 1261 ms 198572 KB Output is correct
3 Correct 342 ms 50948 KB Output is correct

Subtask #8
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 352 ms 51044 KB Output is correct
2 Runtime error 1743 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 374 ms 51212 KB Output is correct
2 Runtime error 1742 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 6856 KB Output is correct
2 Runtime error 1548 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -