Submission #588052

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

struct unko{
    int p;
    bool _[51];
    int know;
    int total;
    unko(){
        for(int i=1;i<51;i++)_[i]=false;
        know=0;
        total=0;
    }
};
int main() {
    int N,M,total=0;
    cin>>N;
    unko p[51];
    for(int i=1;i<=N;i++){
        cin>>p[i].p;
        p[i]._[i]=true;
        p[i].know=1;
        total+=p[i].p;
        p[i].total+=p[i].p;
    }
    cin>>M;
    for(int i = 0; i < M; i++){
        int a,b,c;
        cin>>a>>b>>c;
        if(a){
            if(p[b]._[c])cout<<p[c].p<<" "<<p[c].p<<endl;
            else cout<<max(total-p[b].total-(N-p[b].know-1)*100,0)
            <<" "<<min(total-p[b].total,100)<<endl;
        }
        else{
            p[b]._[c]=true;
            p[b].know++;
            p[b].total+=p[c].p;
        }
    }

    return 0;
}

Submission Info

Judge Result