답안 #1018574

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1018574	2024-07-10T07:01:17 Z	vjudge1	Autići (COCI22_autici)	C++17	50 / 50	34 ms	2016 KB

Main

#include <bits/stdc++.h>
#define int long long
#define endl ('\n')
constexpr long long inf = 1e18;
using namespace std;
bool vis[100001];
int32_t main(){
	int n,ans=0;
	cin>>n;
	vector<pair<int,int>> a(n);
	for(int i=0;i<n;i++){
		cin>>a[i].first;
		a[i].second=i;
	}
	sort(a.begin(),a.end());
	for(int i=1;i<n;i++){
		if(!vis[a[i].second])
			ans+=a[i].first;
			ans+=a[0].first;
			vis[a[i].second]=1;
			vis[a[0].second]=1;
	}
	cout<<ans;
}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:17:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   17 |   if(!vis[a[i].second])
      |   ^~
Main.cpp:19:4: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   19 |    ans+=a[0].first;
      |    ^~~

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	14 ms	1884 KB	Output is correct
3	Correct	30 ms	1928 KB	Output is correct
4	Correct	34 ms	1884 KB	Output is correct
5	Correct	29 ms	2016 KB	Output is correct
6	Correct	25 ms	1880 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	460 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct

Subtask #3

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	14 ms	1884 KB	Output is correct
3	Correct	30 ms	1928 KB	Output is correct
4	Correct	34 ms	1884 KB	Output is correct
5	Correct	29 ms	2016 KB	Output is correct
6	Correct	25 ms	1880 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	460 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	13 ms	1884 KB	Output is correct
22	Correct	27 ms	1952 KB	Output is correct
23	Correct	30 ms	1884 KB	Output is correct
24	Correct	31 ms	1888 KB	Output is correct
25	Correct	33 ms	1880 KB	Output is correct
26	Correct	28 ms	1872 KB	Output is correct
27	Correct	32 ms	1992 KB	Output is correct
28	Correct	29 ms	1872 KB	Output is correct
29	Correct	31 ms	1884 KB	Output is correct
30	Correct	27 ms	1884 KB	Output is correct