Educational Codeforces Round 95 (Rated for Div. 2)

Educational Codeforces Round 95 (Rated for Div. 2)

A. Buying Torches

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
//const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 3e3+ 10;

void solve() {
   ll x,y,k;
   cin>>x>>y>>k;
   cout<<(k*y+k+x-3)/(x-1)+k<<"\n";
}

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

B. Negative Prefixes

#include <bits/stdc++.h>
//#define int ll
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int maxn = 2e5 + 10;

int a[105],b[105];
int c[105];

void solve() {
   int n,top=0;
   cin>>n;
    for (int i = 0; i <n ; ++i) {
        cin>>a[i];
    }
    for (int i = 0; i < n; ++i) {
        cin>>b[i];
        if (!b[i]) c[top++] = a[i];
    }
    sort(c,c+top);
    for (int i = 0; i < n; ++i) {
        if (b[i]) cout<<a[i];
        else cout<<c[--top];
        if(i<n-1) cout<<" ";
    }
    cout<<endl;
}

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

C. Mortal Kombat Tower

#include <bits/stdc++.h>
//#define int ll
using namespace std;

//#pragma GCC optimize(2)

typedef long long ll;
const ll mod = 1e9 + 7;
const int maxn = 2e5 + 10;

int a[maxn];

void solve() {
   int n,sum=0,flag=0;
   cin>>n;
    for (int i = 0; i < n; ++i) cin>>a[i];
    if (a[0]==1)sum=1;
    for (int i=1; i<n; ++i) {
        a[i]?flag++:flag=0;
        if (flag==3) flag=0,sum++;
    }
    cout<<sum<<"\n";
}

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

D. Trash Problem

#include <bits/stdc++.h>
//#define int ll
using namespace std;

#pragma GCC optimize(2)

typedef long long ll;
const ll mod = 1e9 + 7;
const int maxn = 1e5 + 10;

int a[maxn];
set<int > s;
multiset<int ,greater<int > >ms;

void solve() {
    int n,q;
    cin>>n>>q;
    for (int i = 1; i <= n; ++i) {
        cin>>a[i];
        s.insert(a[i]);
    }
    sort(a + 1, a + n + 1);
    ms.insert(0);
    for (int i = 2; i <=n; ++i) {
        ms.insert(a[i] - a[i - 1]);
    }
    for (int i = 0; i <=q; ++i) {
        if (s.size()<=2) cout << "0\n";
        else{
            auto ed=s.end();
            ed--;
            int l=*s.begin(),r=*ed;
            cout << r - l - *ms.begin() << "\n";
        }
        if (i!=q){
            int x,t;
            cin>>x>>t;
            if (x==1){
                s.insert(t);
                auto be=s.begin(),ed=s.end();ed--;
                auto fix=s.find(t);
                if (fix==ed){
                    ms.insert(t-*(--fix));
                } else if (fix==be){
                    ms.insert(*(++fix)-t);
                } else{
                    auto fix2=fix,fix1=fix;
                    ms.insert(t-*--fix1);
                    ms.insert(*++fix2-t);
                    ms.erase(ms.find(*fix2-*fix1));
                }
            } else{
                auto fix=s.find(t);
                auto be=s.begin(),ed=s.end();ed--;
                if (fix==ed){
                    ms.erase(ms.find(t-*(--fix)));
                } else if (fix==be){
                    ms.erase(ms.find(*(++fix)-t));
                } else{
                    auto fix1=fix,fix2=fix;
                    ms.erase(ms.find(t-*--fix2));
                    ms.erase(ms.find(*++fix1-t));
                    ms.insert(*fix1-*fix2);
                }
                s.erase(t);
            }
        }
    }

}

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