1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39

#include <bits/stdc++.h>
#define max(x,y) ((x)<(y)?(y):(x))
#define min(x,y) ((x)>(y)?(y):(x))
#define mk(x,y) make_pair(x,y)
#define lson (now<<1)
#define rson (now<<1|1)
using namespace std;
typedef long long ll;
const int N=2e5+7,inf=1e9+7;
const ll mod=2097152;

void solve()
{
    int x,y;
    cin>>x>>y;
    int ans[10][10];
    ans[0][0]=4;
    ans[0][1]=4;
    ans[0][2]=6;
    ans[1][0]=3;
    ans[1][1]=3;
    ans[1][2]=4;
    ans[2][0]=2;
    ans[2][1]=2;
    ans[2][2]=2;
    cout<<ans[x][y];
}
int main()
{
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);
    int T=1;
    // cin>>T; 
    while(T--) {
        solve();
    }

    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

#include <bits/stdc++.h>
using namespace std;
#define ls now<<1
#define rs now<<1|1
#define endl "\n"
#define lowbit(x) ((x)&(-x))
typedef long long ll;
const int N=1e5+7, mod=1e9+7;

int n,u,v;
int deg[55];

void solve(){
    cin>>n;
    for(int i=1;i<n;i++){
        cin>>u>>v;
        deg[u]++;
        deg[v]++;
    }
    int cnt=0;
    for(int i=1;i<=n;i++){
        if(deg[i]>1)cnt++;
    }
    if((cnt&1)||(!cnt))cout<<"Bob\n";
    else cout<<"Alice\n";
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--)solve();
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52

#include <bits/stdc++.h>
using namespace std;
#define ls now<<1
#define rs now<<1|1
#define endl "\n"
#define lowbit(x) ((x)&(-x))
typedef long long ll;
const int N=1e2+10, mod=1e9+7;

int f[N][N],x,y,q,p;

bool check(int x,int y){
    return (x&&y-x>q);
}

void solve(){
    cin>>x>>y>>p>>q;
    memset(f,-1,sizeof(f));
    for(int i=0;i<=x;i++){
        for(int j=0;j<=y;j++){
            if(check(x-i,y-j))continue;
            if(i==0){
                f[i][j]=0;
                continue;
            }
            if(i<=p){
                f[i][j]=1;
                continue;
            }
            for(int k=0;k<=i&&k<=p;k++){
                int l=p-k;
                if(check(i-k,j-l))continue;
                for(int m=0;m<=p&&m<=y-j+l;m++){
                    if(k==0&&m==p)continue;
                    if(f[i-k][j-l+m]==-1)continue;
                    if(f[i][j]==-1)f[i][j]=2+f[i-k][j-l+m];
                    else f[i][j]=min(f[i][j],2+f[i-k][j-l+m]);
                }
            }
        }
    }
    cout<<f[x][y]<<endl;
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--)solve();
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65

#include <bits/stdc++.h>
using namespace std;
#define ls now<<1
#define rs now<<1|1
#define endl "\n"
#define lowbit(x) ((x)&(-x))
typedef long long ll;
const int N=2e5+7, mod=1e9+7;

struct Node{
    int l,r,cnt;
    ll sum;
}tr[N*2*32];

int tot=0,rt=0;
ll a[N];

void add(int& now,int l,int r,int x,int v){
    if(!now)now=++tot;
    tr[now].sum+=x*v;
    tr[now].cnt+=v;
    if(l==r)return;
    ll mid=(l+r)>>1;
    if(x<=mid)add(tr[now].l,l,mid,x,v);
    else add(tr[now].r,mid+1,r,x,v);
}

int ask(int now,int l,int r,ll x){
    if(!now)return 0;
    if(tr[now].sum<=x)return 0;
    if(l==r)return tr[now].cnt-(x/l);
    ll mid=(l+r)>>1;
    if(tr[tr[now].l].sum>x)return tr[tr[now].r].cnt+ask(tr[now].l,l,mid,x);
    else return ask(tr[now].r,mid+1,r,x-tr[tr[now].l].sum);
}

void solve(){
    int n,q,cnt=0;
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        if(a[i]>0)++cnt;
        add(rt,-1e9,1e9,a[i],1);
    }
    while(q--){
        ll x,v;
        cin>>x>>v;
        if(a[x]>0)--cnt;
        add(rt,-1e9,1e9,a[x],-1);
        a[x]=v;
        add(rt,-1e9,1e9,a[x],1);
        if(a[x]>0)++cnt;
        int tmp=ask(rt,-1e9,1e9,0);
        cout<<cnt-tmp+1<<endl;
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--)solve();
    return 0;
}