提出 #548762

---

ソースコード 拡げる

#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;

using namespace std;

typedef long long ll;


struct range {
    int start, end, target;
    range(int s, int e, int t) {
        start = s;
        end = e;
        target = t;
    }
};

const ll BLACK = -1LL;
const ll WHITE = 0LL;
const int MAX = 100000;
vector<ll> field;

vector<range> list;

ll move(ll s, ll c) {
    ll start = s;
    ll cnt = 0;
    while(cnt != c) {
        for(range r : list) {
            if(r.start <= s && s <= r.end) {
                s = r.target;
                break;
            }
        }
       if(field[s] == WHITE) {
            field[s] = BLACK;
            ++cnt;
            if(cnt == c) break;
            ++s;
       }
    }
    list.push_back(range(start, s, s+1));
    return s;
}

int main() {
    ll N;
    cin >> N;
    vector<ll> S(N, 0LL);
    vector<ll> C(N, 0LL);
    field.assign(MAX+2, WHITE);
    rep(i, N) { cin >> S[i] >> C[i]; }
   
    vector<ll> res(N, 0LL);
    rep(i, N) {
        res[i] = move(S[i], C[i]);
    }

    rep(i, N) {
        cout << res[i] << endl;
    }
	return 0;
}

提出情報

ジャッジ結果