Atcoder Weekday Contest 017

int n,k;
ll res;
 
auto solve = [](){
    ri(n, k);
    for(int i = 0; i < n; i++){
        ll a,b; ri(a, b);
        if(a <= k) res += b;
    }
    po(res);
};

int n,m;
int v[1 << 18];
 
void f(int x){
    if(x < 1 or x > n) return;
    v[x]++;
}
 
auto solve = [](){
    ri(n, m);
    for(int i = 1; i <= n; i++) ri(v[i]);
    while(m--){
        int x; ri(x);
        f(x - 1); f(x); f(x + 1);
    }
    for(int i = 1; i <= n; i++) cout << v[i] << " ";
};

int n,q;
ll v[1 << 18], s[1 << 18];
 
auto solve = [](){
    ri(n, q);
    for(int i = 1; i <= n; i++) ri(v[i]);
    for(int i = 1; i <= n; i++){
        s[i] = (v[i] == v[i - 1]);
    }
    for(int i = 1; i <= n; i++) s[i] += s[i - 1];
    while(q--){
        int a,b; ri(a, b);
        po(s[b] - s[a]);
    }
};

int n,m,k;
ll v[22];
ll res = -iinf;
 
auto solve = [](){
    ri(n, m, k);
    for(int i = 0; i < n; i++) ri(v[i]);
    vector<array<ll, 3>> w;
    for(int i = 0; i < m; i++){
        ll a,b,c; ri(a, b, c); --a,--b;
        w.pb({a, b, c});
    }
    vi c;
    for(int i = 0; i < n; i++) c.pb(i < k ? 0 : 1);
    do{
        ll s = 0;
        vi vist(n + 1);
        for(int i = 0; i < n; i++) if(!c[i]) s += v[i], vist[i] = 1;
        for(const auto& [a, b, c] : w){
            if(vist[a] and vist[b]) s -= c;
        }
        res = max<ll>(res, s);
    }while(next_permutation(all(c)));
    po(res);
};

int n, x[22],y[22];
vector D(22, vector(1 << 20, INF));
int v[22][22];
 
auto f = [](int cur, int state, auto&& f){
	if(state == (1 << n) - 1) return v[cur][0];
	int& ret = D[cur][state];
	if(ret != INF) return ret;
	ret = INF;
	for(int i = 0; i < n; i++){
		if(cur == i or state & (1 << i)) continue;
		ret = min<int>(ret, f(i, state | (1 << i), f) + v[cur][i]);
	}
	return ret;
};
 
void solve(){
	ri(n);
	for(int i = 0; i < n; i++) ri(x[i], y[i]);
	if(n == 2){
		auto x1 = x[0],y1 = y[0];
		auto x2 = x[1],y2 = y[1];
		po(((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)) * 2);
		return;
	}
	for(int i = 0; i < n; i++){
		auto x1 = x[i], y1 = y[i];
		for(int j = 0; j < n; j++){
			auto x2 = x[j], y2 = y[j];
			v[i][j] = ((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
		}
	}
	po(f(0, 1 << 0, f));
}