A - City
答案
#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eps 1e-8
#define x first
#define y second
const int mod = 1e9 + 7;
const int MOD = 1e4+7;
const int N = 1e5 + 10;
const int M = 1111;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
int dxy[][2]={{0,1},{1,0},{1,1},{-1,1}};
using namespace std;
long long mm(long long x,long long y){
if(x<y) return x;
else return y;
}
void solve(){
long long n,m;
cin>>n>>m;
long long ans=0;
for(int i=0;i<=m;i++){
for(int j=0;j<=n;j++){
int r1=mm(j,n-j);
int r2=mm(i,m-i);
ans+=(r1*r2)*2+r1+r2;
}
}
cout<<ans<<endl;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
E - Flow
答案
#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eps 1e-8
#define x first
#define y second
const int mod = 1e9 + 7;
const int MOD = 1e4+7;
const int N = 1e5 + 10;
const int M = 1111;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
int dxy[][2]={{0,1},{1,0},{1,1},{-1,1}};
using namespace std;
int n,m;
vector<PII> edge[N];
vector<int> way[N];
ll sum;
void solve(){
cin>>n>>m;
for(int i=1;i<=m;i++){
int u,v,w;
cin>>u>>v>>w;
edge[u].pb(PII {v,w});
sum+=w;
}
int len=edge[1].size();
for(int i=0;i<len;i++){
PII u=edge[1][i];
int v=u.x;
int w=u.y;
way[i].pb(w);
while(v!=n){
w=edge[v][0].y;
v=edge[v][0].x;
way[i].pb(w);
}
}
for(int i=0;i<len;i++){
sort(way[i].begin(),way[i].end());
}
// cout<<1<<endl;
ll res=0;
ll wlen=way[0].size();
ll ave=sum/wlen;
for(int i=0;i<wlen;i++){
ll maxn=0;
for(int j=0;j<len;j++){
maxn+=way[j][i];
}
res+=max(0ll,ave-maxn);
}
cout<<res<<endl;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
M - Value
答案
#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eps 1e-8
#define x first
#define y second
const int mod = 1e9 + 7;
const int MOD = 1e4+7;
const int N = 1e5 + 10;
const int M = 1111;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
int dxy[][2]={{0,1},{1,0},{1,1},{-1,1}};
using namespace std;
ll n;
ll a[N];
ll b[N];
ll dp[N];
bool vis[N];
bool judge(int x,int y){
if(x<2) return 0;
while(!(y%x)) y/=x;
return y==1;
}
void solve(){
cin>>n;
for(ll i=1;i<=n;i++) cin>>a[i];
for(ll i=1;i<=n;i++) cin>>b[i];
ll res=a[1];
for(ll i=2;i<=n;i++){
if(vis[i]) continue;
ll pos=i;
ll tot=0;
for(ll j=pos;j<=n;j*=pos){
vis[j]=1;
dp[++tot]=j;
}
ll ans=0;
for(int k=0;k<(1<<tot);k++){
ll sum=0;
ll cnt=0;
ll mp[M];
for(int p=1;p<=tot;p++){
if(k&(1<<(p-1))){
mp[++cnt]=dp[p];
}
}
for(int p=1;p<=cnt;p++){
sum+=a[mp[p]];
}
for(int p=1;p<=cnt;p++){
for(int q=p+1;q<=cnt;q++){
if(judge(mp[p],mp[q])){
sum-=b[mp[q]];
}
}
}
ans=max(ans,sum);
}
res+=ans;
}
cout<<res<<endl;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}