2019牛客暑期多校训练营（第四场）

/*


#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int N=1e5+10;
const ll inf=0x3f3f3f3f3f3f3f3f;
struct node {
    ll mi, mx;
}t[N];
ll ans,a[N],b[N]
void build(int rt,int l,int r) {
    t[rt].mx = -inf;
    t[rt].mi = inf;
    if (l == r) {
        t[rt].mi = sum[l];
        t[rt].mx = sum[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(rt << 1, l, mid);
    build(rt << 1 | 1, mid + 1, r);
    t[rt].mx = max(t[rt << 1].mx, t[rt << 1 | 1].mx);
    t[rt].mi = max(t[rt << 1].mi, t[rt << 1 | 1].mi);
}

ll Max(int rt,int L,int R,int l,int r) {
    if (L <= l && r <= R) {
        return t[rt].mx;
        return;
    }
    ll ans = -inf;
    int mid = (l + r) >> 1;
    if (L <= mid) {
        ans = max(ans, Max(rt << 1, L, R, l, mid));
    }
    if (R > mid) {
        ans = max(ans, Max(rt << 1 | 1, L, R, mid + 1, r));
    }
    return ans;
}

ll Min(int rt,int L,int R,int l,int r) {
    if (L <= l && r <= R) {
        return t[rt].mi;
        return;
    }
    ll ans = inf;
    int mid = (l + r) >> 1;
    if (L <= mid) {
        ans = min(ans, Min(rt << 1, L, R, l, mid));
    }
    if (R > mid) {
        ans = min(ans, Min(rt << 1 | 1, L, R, mid + 1, r));
    }
    return ans;
}

int main() {
    ans=inf;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
    }
    for (int i = 1; i <= n; i++) {
        scanf("%d", &b[i]);
        sum[i] = sum[i - 1] + b[i];
    }
    build(1, 1, n);
    stack<int> sta;
    for (int i = n; i >= 1; i++) {
        while (!sta.empty() && a[sta.top()] <= a[i]) {
            sta.pop();
        }
        if (sta.empty()) {
            r[i] = n + 1;
        } else {
            r[i] = sta.top();
        }
        sta.push(i);
    }
    while (!sta.empty()) {
        sta.pop();
    }
    for (int i = 1; i <= n; i++) {
        while (!sta.empty() && a[sta.top()] <= a[i]) {
            sta.pop();
        }
        if (sta.empty()) {
            l[i] = 0;
        } else {
            l[i] = sta.top();
        }
        sta.push(i);
    }
    for (int i = 1; i <= n; i++) {
        int x = a[i], left = l[i] + 1, right = r[i] - 1, y;
        if (x >= 0) {
            y = Max(1, i, right, 1, n) - Min(1, left - 1, i - 1, 1, n);
        } else {
            y = Min(1, i, right, 1, n) - Max(1, left - 1, i - 1, 1, n);
        }
        ans=max(ans,x*y);
    }
}

*/

#include<bits/stdc++.h>

using namespace std;
const int N=7e6;
typedef long long ll;
char s[N];
int sum[N],len,cnt[N];
int main(){
    scanf("%s",s+1);
    len=strlen(s+1);
    for (int i=1;i<=len;i++){
        sum[i]=(sum[i-1]+s[i]-'0')%3;
    }
    ll ans=0;
    for (int i=1;i<=len;i++){
        if (s[i]=='0'){
            ans++;
            if (s[i-1]=='0'){
                ans+=cnt[sum[i]];
            }
        }
        cnt[sum[i-1]]++;
    }
    printf("%d
",ans);
}

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1000100;
const int M=9e6+10;
struct node
{
    int next,to,w;
} e[M];
int h[N],v[N],d[N],tot;
 
int n,m,s,t,k,ans;
void add(int u,int v,int w){
    tot++;
    e[tot].to=v;
    e[tot].w=w;
    e[tot].next=h[u];
    h[u]=tot;
}
 
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >q;
void dij(int s){
    memset(d,0x3f3f3f3f,sizeof(d));
    d[s]=0;
    q.push(make_pair(0,s));
    while (!q.empty()){
        int u=q.top().second;
        q.pop();
        if (v[u]){
            continue;
        }
        v[u]=1;
        for (int i=h[u];i;i=e[i].next){
            int to=e[i].to;
            if (d[to]>d[u]+e[i].w){
                d[to]=d[u]+e[i].w;
                q.push(make_pair(d[to],to));
            }
        }
    }
}
int main()
{
    scanf("%d%d%d%d%d",&n,&m,&s,&t,&k);
    for (int i=1; i<=m; i++)
    {
        int u,v,w;
        scanf("%d%d%d",&u,&v,&w);
        add(u,v,w);
        add(v,u,w);
        for (int j=1; j<=k; j++)
        {
            add(u+n*(j-1),v+j*n,0);
            add(v+n*(j-1),u+j*n,0);
            add(u+n*j,v+j*n,w);
            add(v+n*j,u+j*n,w);
        }
    }
    dij(s);
    ans=0x3f3f3f3f;
    for (int i=0;i<=k;i++){
        ans=min(ans,d[k*n+t]);
    }
    printf("%d
",ans);
    return 0;
}

#include<bits/stdc++.h>
const int N=1e5+10;
using namespace std;
struct node{
    int t,n;
}e[N*2];
int n,m,k,kk;
int d[N],a[N],h[N],t;

void add(int u,int v){
    t++;
    e[t].t=v;
    e[t].n=h[u];
    h[u]=t;
}
void bfs(int x) {
    memset(d, 0, sizeof(d));
    d[x] = 1;
    queue<int> q;
    q.push(x);
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (int i = h[u]; i; i = e[i].n) {
            int v = e[i].t;
            if (!d[v]) {
                d[v] = d[u] + 1;
                q.push(v);
            }
        }
    }
}
int main(){
    scanf("%d%d",&n,&m);
    for (int i=1;i<n;i++){
        int u,v;
        scanf("%d%d",&u,&v);
        add(u,v);
        add(v,u);
    }
    for (int i=1;i<=m;i++){
        scanf("%d",&a[i]);
    }
    bfs(a[1]);
    for (int i=1;i<=m;i++){
        if (d[a[i]]>k){
            k=d[a[i]];
            kk=a[i];
        }
    }
    bfs(kk);
    k=0;
    kk=0;
    for (int i=1;i<=m;i++){
        if (d[a[i]]>k){
            k=d[a[i]];
            kk=a[i];
        }
    }
    printf("%d
",k/2);
}

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int N=3e6+10;
const ll inf=0x3f3f3f3f3f3f3f3f;
struct node {
    ll mi, mx;
}t[N*4];
ll a[N],b,sum[N],n,r[N],l[N];

void build(int rt,int l,int r) {
    if (l == r) {
        t[rt].mi = sum[l];
        t[rt].mx = sum[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(rt << 1, l, mid);
    build(rt << 1 | 1, mid + 1, r);
    t[rt].mx = max(t[rt << 1].mx, t[rt << 1 | 1].mx);
    t[rt].mi = min(t[rt << 1].mi, t[rt << 1 | 1].mi);
}

ll Max(int rt,int L,int R,int l,int r) {
    if (l==r){
        return t[rt].mx;
    }
    if (L <= l && r <= R) {
        return t[rt].mx;
    }
    ll ans = -inf;
    int mid = (l + r) >> 1;
    if (L <= mid) {
        ans=max(ans, Max(rt << 1, L, R, l, mid));
    }
    if (R > mid) {
        ans=max(ans, Max(rt << 1 | 1, L, R, mid + 1, r));
    }
    return ans;
}

ll Min(int rt,int L,int R,int l,int r) {
    if (l == r) {
        return t[rt].mi;
    }
    if (L <= l && r <= R) {
        return t[rt].mi;
    }
    ll ans = inf;
    int mid = (l + r) >> 1;
    if (L <= mid) {
        ans = min(ans, Min(rt << 1, L, R, l, mid));
    }
    if (R > mid) {
        ans = min(ans, Min(rt << 1 | 1, L, R, mid + 1, r));
    }
    return ans;
}

int main() {
    scanf("%lld", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%lld", &a[i]);
    }
    for (int i = 1; i <= n; i++) {
        scanf("%lld", &b);
        sum[i] = sum[i - 1] + b;
    }
    build(1, 1, n);
    stack<int> sta;
    for (int i = n; i >= 1; i--) {
        while (!sta.empty() && a[sta.top()] >= a[i]) {
            sta.pop();
        }
        if (sta.empty()) {
            r[i] = n + 1;
        } else {
            r[i] = sta.top();
        }
        sta.push(i);
    }
    while (!sta.empty()) {
        sta.pop();
    }
    for (int i = 1; i <= n; i++) {
        while (!sta.empty() && a[sta.top()] >= a[i]) {
            sta.pop();
        }
        if (sta.empty()) {
            l[i] = 0;
        } else {
            l[i] = sta.top();
        }
        sta.push(i);
    }
    ll ans = -inf;
    for (int i = 1; i <= n; i++) {
        ll left = l[i] + 1, right = r[i] - 1, y1, y2;
        if (a[i] >= 0) {
            y1 = Max(1, i, right, 1, n);
            y2 = Min(1, left - 1, i - 1, 1, n);
        } else {
            y1 = Min(1, i, right, 1, n);
            y2 = Max(1, left - 1, i - 1, 1, n);
        }
        ans = max(ans, a[i]*(y1 - y2));
    }
    printf("%lld
", ans);
}

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

vector<ll>vec[5];

ll a;
int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        scanf("%lld", &a);
        for (int i = 0; i < 3; i++) {
            vec[i].clear();
        }
        if (a % 3 == 0) {
            printf("1 %lld
", a);
            continue;
        }
        ll now = 1, x = a;
        while (x) {
            if (x & 1) {
                vec[now % 3].push_back(now);
            }
            now <<= 1;
            x = x >> 1;
        }
        printf("2 ");
        if (a % 3 == 1) {
            if (vec[1].size() >= 2) {
                ll p = vec[1][0], q = vec[1][1];
                printf("%lld %lld
", a - p, a - q);
            }
            if (vec[1].size() == 1) {
                ll p = vec[1][0], q = vec[2][0];
                printf("%lld %lld
", a - p, p + q);
            }
            if (vec[1].size() == 0) {
                ll p = vec[2][0], q = vec[2][1], r = vec[2][2];
                printf("%lld %lld
", a - p - q, p + q + r);
            }
        } else {
            if (vec[2].size() >= 2) {
                ll p = vec[2][0], q = vec[2][1];
                printf("%lld %lld
", a - p, a - q);
            }
            if (vec[2].size() == 1) {
                ll p = vec[2][0], q = vec[1][0];
                printf("%lld %lld
", a - p, p + q);
            }
            if (vec[2].size() == 0) {
                ll p = vec[1][0], q = vec[1][1], r = vec[1][2];
                printf("%lld %lld
", a - p - q, p + q + r);
            }
        }
    }
}