oj.uz

답안 #159301

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
159301 2019-10-22T08:21:41 Z AKaan37 Stove (JOI18_stove) C++17
100 / 100
 85 ms 8088 KB 
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
 

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;
typedef pair< lo,PII > PIII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,fa[li],vis[li];
int cev;
multiset <PIII> st;
string s;
vector<int> v;

inline int dsu(int x){
	if(x==fa[x])return x;
	return fa[x]=dsu(fa[x]);
}

int main(void){
	scanf("%d %d",&n,&m);
	FOR fa[i]=i;
	int at=n-m;
	FOR{
		scanf("%d",&a[i]);
		if(i>1)st.insert(mp(a[i]-a[i-1],mp(i,i-1)));
	}
	while(at>0){
		at--;
		PIII p;
		auto it=st.begin();
		st.erase(it);
		p=*it;
		fa[dsu(p.se.fi)]=dsu(p.se.se);
		cev+=p.fi;
		//~ cout<<cev<<endl;
	}
	FOR{
		if(vis[dsu(i)]==0)cev++;
		vis[dsu(i)]=1;
	}
	printf("%d\n",cev);
	return 0;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:50:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
stove.cpp:54:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i]);
   ~~~~~^~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 292 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 292 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 4 ms 636 KB Output is correct
12 Correct 3 ms 632 KB Output is correct
13 Correct 3 ms 636 KB Output is correct
14 Correct 3 ms 632 KB Output is correct
15 Correct 3 ms 632 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 292 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 4 ms 636 KB Output is correct
12 Correct 3 ms 632 KB Output is correct
13 Correct 3 ms 636 KB Output is correct
14 Correct 3 ms 632 KB Output is correct
15 Correct 3 ms 632 KB Output is correct
16 Correct 76 ms 7672 KB Output is correct
17 Correct 85 ms 7772 KB Output is correct
18 Correct 82 ms 8056 KB Output is correct
19 Correct 77 ms 8056 KB Output is correct
20 Correct 73 ms 8056 KB Output is correct
21 Correct 73 ms 8052 KB Output is correct
22 Correct 69 ms 8056 KB Output is correct
23 Correct 76 ms 8056 KB Output is correct
24 Correct 74 ms 8088 KB Output is correct