传送门
题目描述
∀ x i ∈ [ 1 , a i ] , \forall x_i\in[1,a_i], ∀xi∈[1,ai],对于所有满足 ∑ i = 1 n x i ( t i − T ) = 0 \sum_{i=1}^nx_i(t_i-T)=0 ∑i=1nxi(ti−T)=0的情况,求 ∑ i = 1 n x i \sum_{i=1}^nx_i ∑i=1nxi的最大值
分析
我们可以计算大于m和小于m那一边更大,显然如果加和更小的那一边可以全部选取,只需要另一边来中和即可
代码
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#include <cstring>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define _CRT_SECURE_NO_WARNINGS
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 10;
int h[N],e[N],ne[N],idx;
int in[N];
vector<int> ans;
int n,m;
int a[N];
bool flag;
void add(int x,int y){
ne[idx] = h[x],e[idx] = y,h[x] = idx++;
}
void dfs(int x){
for(int i = h[x];~i;i = ne[i]){
int j = e[i];
dfs(j);
if(a[j] != j && a[x] != a[j]){
flag = false;
}
}
if(a[x] == x) ans.push_back(x);
}
int main(){
flag = true;
memset(h,-1,sizeof h);
scanf("%d%d",&n,&m);
while(m--){
int x,y;
scanf("%d%d",&x,&y);
add(x,y);
in[y]++;
}
for(int i = 1;i <= n;i++) scanf("%d",&a[i]);
for(int i = 1;i <= n;i++)
if(!in[i]){
dfs(i);
}
if(!flag){
puts("-1");
return 0;
}
printf("%d\n",ans.size());
for(auto t:ans) printf("%d\n",t);
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┫┫
* ┗┻┛ ┗┻┛+ + + +
*/