Submission #8787280

---

Source Code Expand

#include <bits/stdc++.h>
#define N 110
#define ll long long
#define For(i,x,y) for(int i=(x);i<=(y);++i)
#define Rof(i,x,y) for(int i=(x);i>=(y);--i)
#define Edge(x) for(int i=head[x],to=e[i].v;i;i=e[i].nxt,to=e[i].v)
#define Cur(x) for(int &i=cur[x],to=e[i].v;i;i=e[i].nxt,to=e[i].v)
#define mset(x,y) memset(x,y,sizeof(x))
using namespace std;
const int S=0,T=102;
int dep[N],n,head[N],cur[N],cnt=1,a[N];
queue<int> q;
struct ed{ int v,nxt;ll f; }e[N*32];
void add(int u,int v,ll f){
	e[++cnt]=(ed){v,head[u],f},head[u]=cnt;
	e[++cnt]=(ed){u,head[v],0},head[v]=cnt;
}
bool bfs(){
	while(!q.empty()) q.pop();
	For(i,0,T) cur[i]=head[i],dep[i]=0;
	dep[S]=1,q.push(S);
	while(!q.empty()){
		int x=q.front();q.pop();
		Edge(x) if(!dep[to] && e[i].f) dep[to]=dep[x]+1,q.push(to);
	}
	return dep[T];
}
ll dfs(int x,ll f){
	if(x==T) return f;
	ll use=0;
	Cur(x){
		if(dep[to]==dep[x]+1 && e[i].f){
			ll o=min(f-use,e[i].f);
			ll w=dfs(to,o);
			use+=w,e[i].f-=w,e[i^1].f+=w;
			if(f==use) return f;
		}
	} return use;
}
int main(){
	ll ans=0,sum=0;
	scanf("%d",&n);
	For(i,1,n) scanf("%d",&a[i]),a[i]=-a[i];
	For(i,1,n) for(int j=2*i;j<=n;j+=i) add(i,j,(ll)1e18);
	For(i,1,n){
		if(a[i]>0) add(S,i,a[i]);
		else add(i,T,-a[i]),sum+=-a[i];
	}
	while(bfs()) ans+=dfs(S,(ll)1e18);
	printf("%lld\n",sum-ans);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:42:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:43:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  For(i,1,n) scanf("%d",&a[i]),a[i]=-a[i];
                                         ^

Judge Result