Submission #354335

---

Source Code Expand

#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

double logfact[2000005];

int main() {
	cin.tie(0);
    ios::sync_with_stdio(false);
    
    logfact[0] = 0;
    for(int i = 1; i < 2000005; i++){
        logfact[i] = log(i) + logfact[i-1];
    }
    
    int N;
    cin >> N;
    int p[N], q[N];
    
    for(int i = 0; i < N; i++){
        cin >> p[i] >> q[i];
        p[i]--; q[i]--;
    }
    
    double cp[N];
    //cp[0] = logfact[p[1] + q[1] - p[0] - q[0]] - logfact[p[1] - p[0]] - logfact[q[1] - q[0]];
    cp[0] = logfact[p[0] + q[0]] - logfact[p[0]] - logfact[q[0]];
    //cout << cp[0] << endl;
    for(int i = 1; i < N; i++){
        cp[i] = logfact[p[i] + q[i] - p[i-1] - q[i-1]] - logfact[p[i] - p[i-1]] - logfact[q[i] - q[i-1]];
        //cout << cp[i] << endl;
    }
    
    int Q;
    cin >> Q;
    
    for(int j = 0; j < Q; j++){
        int t;
        cin >> t;
        if(t == 1){
            int k, a, b;
            cin >> k >> a >> b;
            k--; a--; b--;
            p[k] = a; q[k] = b;

            cp[k] = logfact[p[k] + q[k] - p[k-1] - q[k-1]] - logfact[p[k] - p[k-1]] - logfact[q[k] - q[k-1]];
            k++;
            cp[k] = logfact[p[k] + q[k] - p[k-1] - q[k-1]] - logfact[p[k] - p[k-1]] - logfact[q[k] - q[k-1]];
            
            continue;
        }
        int lo, lt, ro, rt;
        cin >> lo >> ro >> lt >> rt;
        double sumo = 0, sumt = 0;
        for(;lo < ro; lo++) sumo += cp[lo];
        for(;lt < rt; lt++) sumt += cp[lt];
        //cout << sumo << " " << sumt << " ";
        cout << (sumo > sumt ? "FIRST" : "SECOND") << endl;
    }
    
	return 0;
}

Submission Info

Judge Result