結果

問題 No.674 n連勤
ユーザー kei
提出日時 2018-04-13 23:32:52
言語 C++14
(gcc 8.3.0)
結果
AC  
実行時間 1,925 ms
コード長 2,351 Byte
コンパイル時間 1,392 ms
使用メモリ 2,256 KB
最終ジャッジ日時 2019-10-19 10:42:53

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
sample1.txt AC 3 ms
1,532 KB
sample2.txt AC 3 ms
1,532 KB
sample3.txt AC 3 ms
1,528 KB
test1.txt AC 4 ms
1,536 KB
test2.txt AC 4 ms
1,532 KB
test3.txt AC 4 ms
1,532 KB
test4.txt AC 4 ms
1,528 KB
test5.txt AC 3 ms
1,532 KB
test6.txt AC 3 ms
1,532 KB
test7.txt AC 3 ms
1,528 KB
test8.txt AC 3 ms
1,528 KB
test9.txt AC 8 ms
1,596 KB
test10.txt AC 11 ms
1,600 KB
test11.txt AC 51 ms
1,824 KB
test12.txt AC 53 ms
1,828 KB
test13.txt AC 51 ms
1,828 KB
test14.txt AC 1,925 ms
2,256 KB
test15.txt AC 1,925 ms
2,256 KB
test16.txt AC 339 ms
2,024 KB
test17.txt AC 59 ms
1,824 KB
テストケース一括ダウンロード

ソースコード

diff #
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }

/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

void solve(){
    ll D,Q; cin >> D >> Q;
    vector<ll> A(Q),B(Q);
    for(int i = 0; i < Q;i++) cin >> A[i] >> B[i];
    queue<pll> q;
    for(int i = 0; i < Q;i++){
        int qs = (int)q.size();
        pll ap = {A[i],B[i]};
        
        bool f = false;
        for(int j = 0; j < qs; j++){
            auto p = q.front(); q.pop();
            if(f){ q.push(p); continue;}
            
            if(p.second+1 < ap.first){
                q.push(p);
                continue;
            }
            if(p.first-1 > ap.second){
                q.push(ap);
                q.push(p);
                f = true;
                continue;
            }
            
            ap.first = min(p.first,ap.first);
            ap.second = max(p.second,ap.second);
        }
        if(!f) q.push(ap);
        
        ll ans = -1;
        qs = int(q.size());
        while(qs--){
            auto p = q.front(); q.pop();
            ans = max(ans,p.second - p.first + 1);
            q.push(p);
        }
        cout << ans << endl;
    }
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    solve();
    return 0;
}
0