Submission #2122250


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#define rank haaaaaaaa
using namespace std;
vector<int> v1;
vector<int> v2;
struct ha
{
	int from;
	int to;
}e[100005];
struct haa
{
	int L;
	int R;
	vector<int> set;
}q[200005];
int L[100005],R[100005],need[100005];
int f[100005],rank[100005];
int ans[100005],maxq=200000;
int cnt;
int n,m,Q;
inline int find(int k)
{
	return f[k]==k?k:f[k]=find(f[k]);
}
inline void join(int x,int y)
{
	x=find(x);
	y=find(y);
	if(x==y) return;
	f[x]=y;
	rank[y]+=rank[x];
	//rank[x]=0;
}
inline int co(int u,int v)
{
	u=find(u);
	v=find(v);
	int tot=rank[u];
	if(u==v)
	tot=rank[u];
	else
	tot=rank[u]+rank[v];
	return tot;
}
int main()
{
	scanf("%d%d",&n,&m);
	register int a,b,c,d;
	for(a=1;a<=n;a++)
	f[a]=a,rank[a]=1;
	for(a=1;a<=m;a++)
	{
		scanf("%d%d",&b,&c);
		e[a].from=b;
		e[a].to=c;
	}
	scanf("%d",&Q);
	q[1].L=0;
	q[1].R=m;
	for(a=1;a<=Q;a++)
	{
		scanf("%d%d%d",&L[a],&R[a],&need[a]);
		q[1].set.push_back(a);
    }
	int head=1,tail=2;
	int cur=0;
	while(head<tail)
	{
		haa tmp=q[head];head=(head+1)%maxq;
		int l=tmp.L,r=tmp.R;
		if(r-l==1) 
		{
			for(a=0;a<tmp.set.size();a++)
			ans[tmp.set[a]]=r;
			continue;
		}
		v1.clear();
		v2.clear();
		int mid=(l+r)>>1;
		if(cur>mid)
		{
			for(b=1;b<=n;b++)
			f[b]=b,rank[b]=1;
			cur=0;
		}
		while(cur<mid)
		{
			cur++;
			int u=e[cur].from;
			int v=e[cur].to;
			join(u,v);
		}
		for(a=0;a<tmp.set.size();a++)
		{
			int k=tmp.set[a];
			int x=L[k];
			int y=R[k];
			if(need[k]>co(x,y))
			v2.push_back(k);
			else
			v1.push_back(k);
		}
		if(v1.size())
		{
			q[tail].L=l;
		    q[tail].R=mid;
		    q[tail].set.clear();
		    q[tail].set=v1;
		    tail=(tail+1)%maxq;
		}
		if(v2.size())
		{
			q[tail].L=mid;
		    q[tail].R=r;
		    q[tail].set.clear();
		    q[tail].set=v2;
		    tail=(tail+1)%maxq;
		}	
	}
	for(a=1;a<=Q;a++)
	printf("%d\n",ans[a]);
	return 0;
}
/*
5 6
2 3
4 5
1 2
1 3
1 4
1 5
6
2 4 3
2 4 4
2 4 5
1 3 3
1 3 4
1 3 5

*/

Submission Info

Submission Time
Task D - Stamp Rally
User longgod
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 2113 Byte
Status AC
Exec Time 181 ms
Memory 21232 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:51:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^
./Main.cpp:57:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&b,&c);
                      ^
./Main.cpp:61:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&Q);
                ^
./Main.cpp:66:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&L[a],&R[a],&need[a]);
                                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 1
AC × 33
Set Name Test Cases
Sample 0_00.txt
All 0_00.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt
Case Name Status Exec Time Memory
0_00.txt AC 3 ms 6784 KB
1_00.txt AC 105 ms 21232 KB
1_01.txt AC 148 ms 20976 KB
1_02.txt AC 108 ms 21104 KB
1_03.txt AC 147 ms 20720 KB
1_04.txt AC 110 ms 20976 KB
1_05.txt AC 152 ms 20720 KB
1_06.txt AC 112 ms 20848 KB
1_07.txt AC 155 ms 20592 KB
1_08.txt AC 120 ms 20848 KB
1_09.txt AC 163 ms 20464 KB
1_10.txt AC 129 ms 20848 KB
1_11.txt AC 163 ms 20464 KB
1_12.txt AC 139 ms 20720 KB
1_13.txt AC 154 ms 20464 KB
1_14.txt AC 112 ms 19440 KB
1_15.txt AC 113 ms 19568 KB
1_16.txt AC 152 ms 17904 KB
1_17.txt AC 174 ms 18288 KB
1_18.txt AC 172 ms 18288 KB
1_19.txt AC 154 ms 17904 KB
1_20.txt AC 164 ms 18032 KB
1_21.txt AC 161 ms 18032 KB
1_22.txt AC 171 ms 18160 KB
1_23.txt AC 175 ms 18416 KB
1_24.txt AC 181 ms 18416 KB
1_25.txt AC 168 ms 18160 KB
1_26.txt AC 160 ms 17904 KB
1_27.txt AC 169 ms 18160 KB
1_28.txt AC 163 ms 18032 KB
1_29.txt AC 179 ms 18416 KB
1_30.txt AC 171 ms 18288 KB
1_31.txt AC 164 ms 18032 KB