Submission #8825626
Source Code Expand
#include <cassert>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <random>
#include <memory>
#include <utility>
#include <limits>
#include "limits.h"
#define rep(i, a, b) for (long long (i) = (a); i < (b); i++)
#define all(i) i.begin(), i.end()
#define debug(i) std::cerr << "debug " <<"LINE:"<<__LINE__<<" "<< #i <<":"<< i << std::endl
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
return os << pa.first << " " << pa.second;
}
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
for (int i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template<typename T1,typename T2>
inline bool chmax(T1& a,T2 b){return a<b && (a=b,true);}
template<typename T1,typename T2>
inline bool chmin(T1& a,T2 b){return a>b && (a=b,true);}
long long pow_mod(long long a, long long b, long long mod=-1) {
if ((a == 0)||(mod!=-1&&a%mod==0)) {
return 0;
}
long long x = 1;
while (b > 0) {
if (b & 1) {
x = (mod!=-1)?(x * a) % mod:x*a;
}
a = (mod!=-1)?(a * a) % mod:a*a;
b >>= 1;
}
return x;
}
// const long long MOD = 998244353;
const long long MOD = 1e9 + 7;
using ll = long long;
using P = std::pair<ll, ll>;
class Dinic{
private:
struct Edge{
long long to,cap,rev;
Edge(long long a,long long b,long long c):to(a),cap(b),rev(c){}
};
long long MAX_V;
std::vector<std::vector<Edge>> graph;
std::vector<long long> level,iter;
void bfs(long long s){
level=std::vector<long long>(MAX_V,-1);
std::queue<long long> que;
level[s]=0;
que.push(s);
while(!que.empty()){
long long v=que.front();que.pop();
for(long long i=0;i<graph[v].size();i++){
const Edge &e = graph[v][i];
if(e.cap>0&&level[e.to]<0){
level[e.to]=level[v]+1;
que.push(e.to);
}
}
}
}
long long dfs(long long v,long long t,long long f){
if(v==t)return f;
for(long long i=iter[v];i<graph[v].size();i++){
Edge &e=graph[v][i];
if(e.cap>0&&level[v]<level[e.to]){
long long d=dfs(e.to,t,std::min(f,e.cap));
if(d>0){
e.cap-=d;
graph[e.to][e.rev].cap+=d;
return d;
}
}
}
return 0;
}
public:
Dinic(long long n):graph(n),level(n),iter(n),MAX_V(n){}
void add_edge(long long from,long long to,long long cap){
graph[from].emplace_back(Edge(to,cap,graph[to].size()));
graph[to].emplace_back(Edge(from,0,graph[from].size()));
}
long long max_flow(long long s,long long t){
long long flow=0;
while(1){
bfs(s);
if(level[t]<0)return flow;
iter=std::vector<long long>(MAX_V,0);
long long f;
while((f=dfs(s,t,LLONG_MAX))>0){
flow+=f;
}
}
}
};
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
ll n;
std::cin>>n;
const long long INF=1e14;
Dinic flow(n+2);
ll sum=0;
rep(i,1,n+1){
ll a;
std::cin>>a;
if(a>=0){
sum+=a;
flow.add_edge(i,n+1,a);
}else{
flow.add_edge(0,i,-a);
}
for(ll j=2*i;j<n+1;j+=i){
flow.add_edge(i,j,INF);
}
}
std::cout<<sum-flow.max_flow(0,n+1)<<"\n";
return 0;
}
Submission Info
Submission Time |
|
Task |
E - MUL |
User |
Imperi |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
3725 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
700 / 700 |
Status |
|
|
Set Name |
Test Cases |
Sample |
example_0, example_1, example_2, example_3 |
All |
example_0, example_1, example_2, example_3, kimeuti_0, kimeuti_1, kimeuti_10, kimeuti_11, kimeuti_12, kimeuti_13, kimeuti_14, kimeuti_15, kimeuti_16, kimeuti_17, kimeuti_18, kimeuti_19, kimeuti_2, kimeuti_3, kimeuti_4, kimeuti_5, kimeuti_6, kimeuti_7, kimeuti_8, kimeuti_9, rand_0, rand_1, rand_10, rand_11, rand_12, rand_13, rand_14, rand_15, rand_16, rand_17, rand_18, rand_19, rand_2, rand_3, rand_4, rand_5, rand_6, rand_7, rand_8, rand_9, small_0, small_1, small_2, small_3, small_4 |
Case Name |
Status |
Exec Time |
Memory |
example_0 |
AC |
1 ms |
256 KB |
example_1 |
AC |
1 ms |
256 KB |
example_2 |
AC |
1 ms |
256 KB |
example_3 |
AC |
1 ms |
256 KB |
kimeuti_0 |
AC |
1 ms |
256 KB |
kimeuti_1 |
AC |
1 ms |
256 KB |
kimeuti_10 |
AC |
1 ms |
256 KB |
kimeuti_11 |
AC |
1 ms |
256 KB |
kimeuti_12 |
AC |
1 ms |
256 KB |
kimeuti_13 |
AC |
1 ms |
256 KB |
kimeuti_14 |
AC |
1 ms |
256 KB |
kimeuti_15 |
AC |
1 ms |
256 KB |
kimeuti_16 |
AC |
1 ms |
256 KB |
kimeuti_17 |
AC |
1 ms |
256 KB |
kimeuti_18 |
AC |
1 ms |
256 KB |
kimeuti_19 |
AC |
1 ms |
256 KB |
kimeuti_2 |
AC |
1 ms |
256 KB |
kimeuti_3 |
AC |
1 ms |
256 KB |
kimeuti_4 |
AC |
1 ms |
256 KB |
kimeuti_5 |
AC |
1 ms |
256 KB |
kimeuti_6 |
AC |
1 ms |
256 KB |
kimeuti_7 |
AC |
1 ms |
256 KB |
kimeuti_8 |
AC |
1 ms |
256 KB |
kimeuti_9 |
AC |
1 ms |
256 KB |
rand_0 |
AC |
1 ms |
256 KB |
rand_1 |
AC |
1 ms |
256 KB |
rand_10 |
AC |
1 ms |
256 KB |
rand_11 |
AC |
1 ms |
256 KB |
rand_12 |
AC |
1 ms |
256 KB |
rand_13 |
AC |
1 ms |
256 KB |
rand_14 |
AC |
1 ms |
256 KB |
rand_15 |
AC |
1 ms |
256 KB |
rand_16 |
AC |
1 ms |
256 KB |
rand_17 |
AC |
1 ms |
256 KB |
rand_18 |
AC |
1 ms |
256 KB |
rand_19 |
AC |
1 ms |
256 KB |
rand_2 |
AC |
1 ms |
256 KB |
rand_3 |
AC |
1 ms |
256 KB |
rand_4 |
AC |
1 ms |
256 KB |
rand_5 |
AC |
1 ms |
256 KB |
rand_6 |
AC |
1 ms |
256 KB |
rand_7 |
AC |
1 ms |
256 KB |
rand_8 |
AC |
1 ms |
256 KB |
rand_9 |
AC |
1 ms |
256 KB |
small_0 |
AC |
1 ms |
256 KB |
small_1 |
AC |
1 ms |
256 KB |
small_2 |
AC |
1 ms |
256 KB |
small_3 |
AC |
1 ms |
256 KB |
small_4 |
AC |
1 ms |
256 KB |