#570502 (C++14) No.1268 Fruit Rush 2

• 問題: No.1268 Fruit Rush 2
• ユーザー: tsutaj
• 提出日時: 2020-10-23 22:56:11
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 52 ms / 2,000 ms
• コード長: 2,294 bytes
• コンパイル時間: 1,055 ms
• コンパイル使用メモリ: 108,072 KB
• 実行使用メモリ: 5,844 KB
• 最終ジャッジ日時: 2024-07-21 12:05:32
• 合計ジャッジ時間: 3,196 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 33

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;
 
int main() {
    int N; scanf("%d", &N);
    vector<ll> odd, even;
    for(int i=0; i<N; i++) {
        ll v; scanf("%lld", &v);
        if(v % 2) odd.emplace_back(v);
        else even.emplace_back(v);
    }
    sort(odd.begin(), odd.end());
    sort(even.begin(), even.end());
    vector<int> nxt_odd(odd.size(), 1), nxt_even(even.size(), 1);
    for(int i=(int)odd.size()-2; i>=0; i--) {
        if(odd[i+1] - odd[i] == 2) nxt_odd[i] = nxt_odd[i+1] + 1;
    }
    for(int i=(int)even.size()-2; i>=0; i--) {
        if(even[i+1] - even[i] == 2) nxt_even[i] = nxt_even[i+1] + 1;
    }
    ll ans = N;
    {
        int ie = 0;
        for(int io=0; io<(int)odd.size(); io++) {
            while(ie < (int)even.size() and odd[io] + 1 > even[ie]) ie++;
            if(ie >= (int)even.size()) continue;
            if(even[ie] != odd[io] + 1) continue;
            int len = nxt_even[ie];
            ans += len;
        }
    }
    {
        int io = 0;
        for(int ie=0; ie<(int)even.size(); ie++) {
            while(io < (int)odd.size() and even[ie] + 1 > odd[io]) io++;
            if(io >= (int)odd.size()) continue;
            if(odd[io] != even[ie] + 1) continue;
            int len = nxt_odd[io];
            ans += len;
        }
    }
    printf("%lld\n", ans);
    
    
    // 1 2 4 6 -> 3 4 6 -> 5 6 -> 7
    // 1 2 . 4 . 6
    // 2 3 . 5
    // 3 4 . 6
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX