Contest Duration: - (local time) (90 minutes) Back to Home

Submission #11171696

Source Code Expand

Copy
```#include <bits/stdc++.h>
#include <cmath>

const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//typedef pair<ll, ll> P;
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;

std::istream &operator>>(std::istream &in, set<int> &o) {
ll a;
in >> a;
o.insert(a);
return in;
}

std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}

bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }

//ofstream outfile("log.txt");
//outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0') << rank << endl;
// std::cout << std::bitset<8>(9);
const int mod = 1000000007;
//const ll mod = 1e10;
typedef priority_queue<string, vector<string>, greater<string> > PQ_ASK;

#include <iostream>
#include <vector>

using namespace std;

void tow_pointer(int n,
function<bool(int left)> check_begin,
function<void(int left)> begin,
function<bool(int right)> check_right,
function<void(int right)> push_right,
function<void(int left)> pop_left,
) {

auto go = [&](P range) {
int right = -1;
for (int left = range.first; left <= range.second; left++) {
if (right < left) {
right = left;
begin(left);
}
while (right + 1 <= range.second && check_right(right + 1)) {
right++;
push_right(right);
}
pop_left(left);
}
};

auto get_ranges = [&] {
vector<bool> enable_items(n);
rep(i, n) enable_items[i] = check_begin(i);

auto start = [&](int i) {
if (i == 0) {
return enable_items[i] == true;
}
if (!enable_items[i - 1] && enable_items[i]) {
return true;
}
return false;
};

auto end = [&](int i) {

if (i == n - 1) {
return enable_items[i] == true;
}

if (enable_items[i] && !enable_items[i + 1]) {
return true;
}

return false;
};

vector<P> ans;
P p;
rep(i, n) {
if (start(i)) {
p = P(i, -1);
}
if (end(i)) {
p.second = i;
ans.push_back(p);
}
}
return ans;
};

vector<P> ranges = get_ranges();
for (P range: ranges) go(range);
}

int main() {
int n;
cin >> n;
set<ll> sweets;
vector<ll> numbers(n);
rep(i, n) cin >> numbers[i];

auto check_begin = [&](int i) {
return true;
};

auto begin = [&](int i) {
sweets.insert(numbers[i]);
};

auto check_right = [&](int right) {
return sweets.find(numbers[right]) == sweets.end();
};

auto push_right = [&](int right) {
sweets.insert(numbers[right]);

};
auto pop_left = [&](int left) {
assert(sweets.find(numbers[left]) != sweets.end());
sweets.erase(numbers[left]);

};

ll ans = 0;

auto dead_end = [&](int left, int right) {
ll now = sweets.size();
cmax(ans, now);
};

tow_pointer(
n,
check_begin,
begin,
check_right,
push_right,
pop_left,
);
cout << ans << endl;

}
```

#### Submission Info

Submission Time 2020-03-24 14:16:53+0900 B - 細長いお菓子 riku_tanide C++14 (GCC 5.4.1) 100 4024 Byte AC 74 ms 5760 KB

#### Judge Result

Score / Max Score 0 / 0 50 / 50 49 / 49 1 / 1
Status
 AC × 2
 AC × 14
 AC × 24
 AC × 31
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask2_01.txt AC 1 ms 256 KB
subtask2_02.txt AC 1 ms 256 KB
subtask2_03.txt AC 1 ms 256 KB
subtask2_04.txt AC 1 ms 256 KB
subtask2_05.txt AC 1 ms 256 KB
subtask2_06.txt AC 1 ms 256 KB
subtask2_07.txt AC 2 ms 256 KB
subtask2_08.txt AC 2 ms 256 KB
subtask2_09.txt AC 2 ms 256 KB
subtask2_10.txt AC 1 ms 256 KB
subtask3_01.txt AC 14 ms 512 KB
subtask3_02.txt AC 35 ms 768 KB
subtask3_03.txt AC 34 ms 768 KB
subtask3_04.txt AC 61 ms 1024 KB
subtask3_05.txt AC 61 ms 1152 KB
subtask3_06.txt AC 61 ms 1024 KB
subtask3_07.txt AC 74 ms 5760 KB