Submission #38408

---

Source Code Expand

#include <cstdio>
#include <vector>
#include <deque>
#include <queue>
#include <map>
#include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <cmath>

using namespace std;

void returnTuple(long long n, vector<long long> &tuple){
    long long triNum = 1;
    long long sum = 2;
    while(1){
        if (n <= triNum){
            long long diff = triNum - n;
            tuple[0] = 1 + diff;
            tuple[1] = sum - tuple[0];
            return;
        }

        triNum += sum;
        ++sum;
    }
}

long long returnIndex(vector<long long> &tuple){
    long long triNum = 0;
    long long sum = 2;
    while(1){
        if (sum == tuple[0] + tuple[1]){
            return triNum + tuple[1];
        }

        triNum += sum-1;
        ++sum;
    }
    
}

int main(void)
{
    long long i, j;
    cin >> i >> j;

    // debug
    //for(long long i = 100000000-4; i < 100000000; ++i){
//    for(long long i = 1; i < 100; ++i){
//        vector<long long> tmp(2);
//        returnTuple(i, tmp);
//        cout << "i[" << i << "] = " << tmp[0] << ", " << tmp[1] << endl;
//
//        cout << "ret index = " << returnIndex(tmp) << endl;
//    }

    vector<long long> t1(2);
    vector<long long> t2(2);
    returnTuple(i, t1);
    returnTuple(j, t2);
    t1[0] += t2[0];
    t1[1] += t2[1];
    cout << returnIndex(t1) << endl;
    
    return 0;
}

Submission Info

Judge Result