Submission #5538055

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int N = 205;
const int INF = 1e9;

struct Edge {
   int v,cap,rev;
   Edge(int v,int cap,int rev) : v(v),cap(cap),rev(rev) {
   }
};

vector<Edge> vt[N];

void addEdge(int u,int v,int cap) {
   vt[u].push_back(Edge(v,cap,vt[v].size()));
   vt[v].push_back(Edge(u,0,vt[u].size()-1));
}

int level[N];

bool bfs(int s,int t) {
   memset(level,-1,sizeof(level));
   level[s] = 0;
   queue<int> q;
   q.push(s);
   while(!q.empty()) {
      int node = q.front();
      q.pop();
      for(int i=0;i<vt[node].size();++i) {
         int there = vt[node][i].v;
         int cap = vt[node][i].cap;
         if(level[there]==-1 && cap>0) {
            level[there] = level[node] + 1;
            q.push(there);
         }
      }
   }
   return level[t]!=-1;
}
int work[N];
int dfs(int here,int minCap,int t) {
   if(here==t) {
      return minCap;
   }
   for(int &i = work[here];i< vt[here].size();++i) {
      int there = vt[here][i].v;
      int cap = vt[here][i].cap;
      if(level[there] == level[here]+1 && cap>0) {
         int c = dfs(there,min(minCap,cap),t);
         if(c>0) {
            int rid = vt[here][i].rev;
            vt[here][i].cap -= c;
            vt[there][rid].cap += c;
            return c;
         }
      }
   }
   return 0;
}
ll findMinCut(int s,int t) {
   ll ret= 0;
   while(bfs(s,t)) {
      memset(work,0,sizeof(work));
      while(true) {
         int r = dfs(s,INF,t);
         ret += r;
         if(r==0) {
            break;
         }
      }
   }
   return ret;
}

int A[N];

void solve() {
   int n;
   scanf("%d",&n);
   for(int i=1;i<=n;++i) {
      scanf("%d",&A[i]);
   }
   int s = n+1,t = n+2;
   ll ret = 0;
   for(int i=1;i<=n;++i) {
      if(A[i]<=0) {
         addEdge(s,i,-A[i]);
         for(int j = i+i;j<=n;j+=i) {
            addEdge(i,j,INF);
         }
      } else {
         ret += A[i];
         addEdge(i,t,A[i]);
      }
   }
   ret -= findMinCut(s,t);
   printf("%lld\n", ret);
}

int main() {
   //freopen("input.txt","r",stdin);
   solve();
}

Submission Info

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:81:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&n);
                  ^
./Main.cpp:83:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d",&A[i]);
                        ^

Judge Result