Submission #16806031


Source Code Expand

#include<cstdio>
#include<vector>
#include<algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
typedef long long ll;
const int N=1e5+9;
int n,m,a[N],b[N],_[N],u,v,fa[N],t,d[N];
vector<int>e[N];
ll f[N],sz[N];
bool p[N];
ll min(ll x,ll y) {return x<y?x:y;}
ll max(ll x,ll y) {return x>y?x:y;}
bool cmp(int x,int y) {return a[x]<a[y];}
int gef(int x) {return fa[x]?fa[x]=gef(fa[x]):x;}
int main()
{
	scanf("%d%d",&n,&m);
	fo(i,1,n) scanf("%d%d",a+i,b+i), a[_[i]=i]=max(a[i]-b[i],0), sz[i]=b[i];
	fo(i,1,m) scanf("%d%d",&u,&v), e[u].push_back(v), e[v].push_back(u);
	sort(_+1,_+n+1,cmp);
	fo(i,1,n)
	{
		int x=_[i]; p[x]=1,t=0;
		for(int y:e[x]) if(p[y]&&gef(x)!=gef(y)) {fa[v=gef(y)]=x; sz[x]+=sz[d[++t]=v];}
		f[x]=sz[x]+a[x];
		for(int y;y=d[t];t--) f[x]=min(f[x],sz[x]-sz[y]+max(a[x],f[y]));
	}
	printf("%lld",f[gef(1)]);
}

Submission Info

Submission Time
Task F - Donation
User Iking
Language C++ (GCC 9.2.1)
Score 1000
Code Size 873 Byte
Status AC
Exec Time 81 ms
Memory 12008 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:27:14: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   27 |   for(int y;y=d[t];t--) f[x]=min(f[x],sz[x]-sz[y]+max(a[x],f[y]));
      |             ~^~~~~
./Main.cpp:18:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   18 |  scanf("%d%d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~
./Main.cpp:19:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   19 |  fo(i,1,n) scanf("%d%d",a+i,b+i), a[_[i]=i]=max(a[i]-b[i],0), sz[i]=b[i];
      |            ~~~~~^~~~~~~~~~~~~~~~
./Main.cpp:20:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   20 |  fo(i,1,m) scanf("%d%d",&u,&v), e[u].push_back(v), e[v].push_back(u);
      |            ~~~~~^~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 3
AC × 54
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt, subtask_1_42.txt, subtask_1_43.txt, subtask_1_44.txt, subtask_1_45.txt, subtask_1_46.txt, subtask_1_47.txt, subtask_1_48.txt
Case Name Status Exec Time Memory
sample_01.txt AC 9 ms 5440 KiB
sample_02.txt AC 4 ms 5584 KiB
sample_03.txt AC 5 ms 5616 KiB
subtask_1_01.txt AC 6 ms 5492 KiB
subtask_1_02.txt AC 13 ms 5740 KiB
subtask_1_03.txt AC 22 ms 6700 KiB
subtask_1_04.txt AC 7 ms 5564 KiB
subtask_1_05.txt AC 7 ms 5596 KiB
subtask_1_06.txt AC 4 ms 5576 KiB
subtask_1_07.txt AC 4 ms 5552 KiB
subtask_1_08.txt AC 5 ms 5508 KiB
subtask_1_09.txt AC 8 ms 5476 KiB
subtask_1_10.txt AC 8 ms 5552 KiB
subtask_1_11.txt AC 6 ms 5552 KiB
subtask_1_12.txt AC 3 ms 5524 KiB
subtask_1_13.txt AC 27 ms 6508 KiB
subtask_1_14.txt AC 12 ms 5724 KiB
subtask_1_15.txt AC 23 ms 6548 KiB
subtask_1_16.txt AC 63 ms 10880 KiB
subtask_1_17.txt AC 29 ms 6944 KiB
subtask_1_18.txt AC 66 ms 11168 KiB
subtask_1_19.txt AC 26 ms 6992 KiB
subtask_1_20.txt AC 72 ms 11176 KiB
subtask_1_21.txt AC 70 ms 11144 KiB
subtask_1_22.txt AC 36 ms 8288 KiB
subtask_1_23.txt AC 40 ms 8132 KiB
subtask_1_24.txt AC 28 ms 7376 KiB
subtask_1_25.txt AC 21 ms 6628 KiB
subtask_1_26.txt AC 66 ms 10724 KiB
subtask_1_27.txt AC 52 ms 9708 KiB
subtask_1_28.txt AC 10 ms 5816 KiB
subtask_1_29.txt AC 64 ms 9380 KiB
subtask_1_30.txt AC 72 ms 11064 KiB
subtask_1_31.txt AC 16 ms 6184 KiB
subtask_1_32.txt AC 81 ms 11940 KiB
subtask_1_33.txt AC 71 ms 11876 KiB
subtask_1_34.txt AC 70 ms 11888 KiB
subtask_1_35.txt AC 72 ms 11908 KiB
subtask_1_36.txt AC 76 ms 11916 KiB
subtask_1_37.txt AC 67 ms 11928 KiB
subtask_1_38.txt AC 79 ms 11888 KiB
subtask_1_39.txt AC 69 ms 12008 KiB
subtask_1_40.txt AC 73 ms 11896 KiB
subtask_1_41.txt AC 66 ms 11896 KiB
subtask_1_42.txt AC 75 ms 11884 KiB
subtask_1_43.txt AC 72 ms 11892 KiB
subtask_1_44.txt AC 70 ms 11960 KiB
subtask_1_45.txt AC 76 ms 11848 KiB
subtask_1_46.txt AC 79 ms 11956 KiB
subtask_1_47.txt AC 81 ms 11808 KiB
subtask_1_48.txt AC 78 ms 11844 KiB