oj.uz

Submission #423465

# Submission time Handle Problem Language Result Execution time Memory
423465 2021-06-11T07:34:00 Z Apiram Beads and wires (APIO14_beads) C++14
0 / 100
 1 ms 204 KB 
#include<bits/stdc++.h>
using namespace std;
struct point {
	int u,v,w;
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
vector<point>adj(n);
for (int i =0;i<n;++i){
	cin>>adj[i].u>>adj[i].v>>adj[i].w;
} 
sort(adj.begin(),adj.end(),[&](point a,point b){
		return a.w>b.w;
});
int64_t score=0;
vector<bool>visited(n,false);
vector<bool>visited2(n,false);
for (int i =0;i<n;++i){
	if (visited[i])continue;
	for (int j =i+1;j<n;++j){
		if (!visited[j]){
			if ((adj[i].u==adj[j].u&&!visited2[adj[i].u])){
				visited[j]=true;
				score+=adj[i].w+adj[j].w;
				visited2[adj[i].u]=true;
				break;
			}
			else if ((adj[i].u==adj[j].v&&!visited2[adj[j].v])){
				visited[j]=true;
				score+=adj[i].w+adj[j].w;
				visited2[adj[i].u]=true;
				break;
			}
			else if ((adj[i].v==adj[j].u&&!visited2[adj[j].u])){
				visited[j]=true;
				score+=adj[i].w+adj[j].w;
				visited2[adj[i].v]=true;
				break;
			}
			else if ((adj[i].v==adj[j].v&&!visited[adj[j].v])){
				visited[j]=true;
				score+=adj[i].w+adj[j].w;
				visited2[adj[i].v]=true;
		}}
	}
}
cout<<score<<endl;
return 0;}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -