2018ccpc_hn

A. Easy h-index

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <map>
#include <cmath>
#include <vector>

#define Faster ios::sync_with_stdio(false),cin.tie(0)
#define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
#define Close fclose(stdin),fclose(stdout)
const int maxn = 2*1e5 + 5;
using namespace std;
const int MOD = 1e9+7;
typedef long long ll;

int a[maxn];

int main(){
    Faster;
    int n;
    while(cin >> n){
        for(int i = 0;i <= n;i++){
            cin >> a[i];
        }
    
        int sum = 0;
        int h = n+1;
        while(sum < h){
            sum += a[--h];
        }
        cout << h << endl;
    }
    return 0;
}

B. Higher h-index

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <map>
#include <cmath>
#include <vector>

#define Faster ios::sync_with_stdio(false),cin.tie(0)
#define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
#define Close fclose(stdin),fclose(stdout)
const int maxn = 2*1e5 + 5;
using namespace std;
const int MOD = 1e9+7;
typedef long long ll;

int a[maxn];

int main(){
    Faster;
    int n, a;
    while(cin >> n >> a){
        if(n < a)
            cout << n << endl;
        else{
            int h = a + (n-a)/2; 
            cout << h << endl;
        }
    }
    return 0;
}

F. Sorting

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <map>
#include <cmath>
#include <vector>

#define Faster ios::sync_with_stdio(false),cin.tie(0)
#define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
#define Close fclose(stdin),fclose(stdout)
const int maxn = 1e3+5;
using namespace std;
const int MOD = 1e9+7;
typedef long long ll;

struct node
{
    ll a,b,c;
    int id;
}t[maxn];

bool cmp(node x, node y){
    ll xx = x.a*y.c + x.b*y.c;
    ll yy = y.a*x.c + y.b*x.c;
    if(xx == yy)
        return x.id < y.id;
    return xx < yy;
}

int main(){
    Faster;
    int n;
    while(cin >> n){
        for(int i = 0;i < n;i++){
            cin >> t[i].a >> t[i].b >> t[i].c;
            t[i].id = i+1;
        }
        sort(t,t+n,cmp);
        for(int i = 0;i < n;i++){
            if(i == 0)
                cout << t[i].id;
            else
                cout << " " << t[i].id;
        }
        cout << endl;
    }
    return 0;
}

G. String Transformation

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <map>
#include <cmath>
#include <vector>

#define Faster ios::sync_with_stdio(false),cin.tie(0)
#define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
#define Close fclose(stdin),fclose(stdout)
const int maxn = 1e5 + 5;
using namespace std;
const int MOD = 1e9+7;
typedef long long ll;

int main(){
    Faster;
    string s;
    string t;
    while(cin >> s >> t){
        int sc, tc;
        sc = tc = 0;
        for(char x:s){
            if(x == 'c'){
                sc++;
            }
        }
        for(char x:t){
            if(x == 'c'){
                tc++;
            }
        }
        if(sc != tc){
            cout << "No" << endl;
            continue;
        }
        int i, j, sa, sb, ta, tb;
        i = j = sa = sb = ta = tb = 0;
        bool ok = true;
        s += "c";
        t += "c";
        while(i < s.size() && j < t.size()){
            while(s[i] != 'c' && i < s.size()){
                if(s[i] == 'a')
                    sa++;
                if(s[i] == 'b')
                    sb++;
                i++;
            }
            while(t[j] != 'c' && j < t.size()){
                if(t[j] == 'a')
                    ta++;
                if(t[j] == 'b')
                    tb++;
                j++;
            }
            if( sa%2 != ta%2 || sb%2 != tb%2){
                ok = false;
                break;
            }
            if(s[i] == 'c'){
                sa = sb = 0;
                i++;
            }
            if(t[j] == 'c'){
                ta = tb = 0;
                j++;
            }
        }
        if(ok)
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }
    return 0;
}

K. 2018

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <map>
#include <cmath>
#include <vector>

#define Faster ios::sync_with_stdio(false),cin.tie(0)
#define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
#define Close fclose(stdin),fclose(stdout)
const int maxn = 1e4 + 5;
using namespace std;
const int MOD = 1e9+7;
typedef long long ll;

int main(){
    Faster;
    ll a, b, c, d;
    while(cin >> a >> b >> c >> d){
        ll sum = 0;
        ll x = (b/2018 - (a-1)/2018);
        ll y = (d/2018 - (c-1)/2018);
        sum += x*(d-c+1)+y*(b-a+1)-x*y;            //减去重复的部分

        sum += (b/1009 - (a-1)/1009 - x)*(d/2 - (c-1)/2 - y);
        sum += (d/1009 - (c-1)/1009 - y)*(b/2 - (a-1)/2 - x);
        cout << sum << endl;
    }

    return 0;
}