oj.uz

Submission #1015415

# Submission time Handle Problem Language Result Execution time Memory
1015415 2024-07-06T10:27:17 Z amirhoseinfar1385 Friend (IOI14_friend) C++17
19 / 100
 3 ms 13148 KB 
#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=100000+10;
struct node{
	int w,vas,did;
	node(){
		w=vas=did=0;
	}
	set<int>adj,revadj;
};
node alln[maxn];
int nem[maxn],miad[maxn],jam[maxn],te=0,now;

void adde(int u,int v){
	alln[u].adj.insert(v);
	alln[v].revadj.insert(u);
}

void dorost(int v,int w){
	nem[v]=te;
	miad[v]=te+1;
	jam[v]=te+2;
	alln[miad[v]].w=w;
	alln[jam[v]].adj.insert(nem[v]);
	alln[jam[v]].adj.insert(miad[v]);
	alln[jam[v]].vas=1;
	te+=3;
}

void comp(int v,int u,int val,int no){
	dorost(v,val);
	if(no==0){
		adde(miad[u],nem[v]);
		adde(nem[u],jam[v]);
	}else if(no==1){
		now++;
		dorost(now,0);
		swap(alln[nem[u]].adj,alln[nem[now]].adj);
		swap(alln[miad[u]].adj,alln[miad[now]].adj);
		adde(miad[u],miad[now]);
		adde(nem[u],nem[now]);
		adde(miad[v],miad[now]);
		adde(nem[v],nem[now]);
		for(auto x:alln[nem[u]].revadj){
			adde(x,nem[v]);
		}
		for(auto x:alln[miad[u]].revadj){
			adde(x,miad[v]);
		}
		for(auto x:alln[jam[u]].revadj){
			adde(x,jam[v]);
		}
	}else{

	}
}

void calc(int u){
	if(alln[u].did==1){
		return ;
	}
	alln[u].did=1;
	if(alln[u].vas==1){
		for(auto x:alln[u].adj){
			calc(x);
			alln[u].w=max(alln[u].w,alln[x].w);
		}
	}else{
		for(auto x:alln[u].adj){
			calc(x);
			alln[u].w+=alln[x].w;
		}
	}
//	cout<<u<<" "<<alln[u].w<<endl;
}

int findSample(int n,int confidence[],int host[],int protocol[]){
	dorost(0,confidence[0]);
	now=n+1;
	for(int i=1;i<n;i++){
//		cout<<"wtf: "<<i<<" "<<host[i]<<endl;
		comp(i,host[i],confidence[i],protocol[i]);
	}
//	for(int i=0;i<n;i++){
//		cout<<miad[i]<<" "<<nem[i]<<" "<<jam[i]<<endl;
//	}
	calc(jam[0]);
	return alln[jam[0]].w;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 1 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12768 KB Output is correct
5 Correct 2 ms 12764 KB Output is correct
6 Correct 2 ms 13144 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Incorrect 2 ms 12664 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 12636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 12636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12632 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 13148 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12988 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 3 ms 12636 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 12636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

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