| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 737225 | Olympia | Zoltan (COCI16_zoltan) | C++17 | 668 ms | 31628 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <set>
#include <cmath>
#include <queue>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <algorithm>
#include <cassert>
#include <map>
#include <deque>
using namespace std;
const int MOD = 1e9 + 7;
struct SegmentTree {
vector<pair<int,int>> vec;
pair<int,int> id = make_pair(-1, 1);
pair<int,int> merge (pair<int,int64_t> left, pair<int,int64_t> right) {
if (left.first == -1) return right;
if (right.first == -1) return left;
if (left.first > right.first) return left;
if (left.first < right.first) return right;
left.second = ((int64_t)right.second + (int64_t)left.second) % MOD;
return left;
}
pair<int,int> query (int dum, int tl, int tr, int l, int r) {
if (tl >= l and tr <= r) {
return vec[dum];
}
if (r < tl or tr < l) {
return id;
}
return merge(query(2 * dum + 1, tl, (tl + tr)/2, l, r), query(2 * dum + 2, (tl + tr)/2 + 1, tr, l, r));
}
pair<int,int> query (int l, int r) {
return query(0, 0, (int)vec.size()/2 - 1, l, r);
}
void update (int dum, pair<int,int64_t> node) {
dum += (int)vec.size()/2 - 1;
vec[dum] = node;
while (dum != 0) {
dum = (dum - 1)/2;
vec[dum] = merge(vec[2 * dum + 1], vec[2 * dum + 2]);
}
}
SegmentTree (int n) {
n = (1 << (int)log2(n)) * 2;
vec.assign(2 * n, id);
}
};
SegmentTree st = SegmentTree(1);
vector<pair<int,int>> lis (vector<int>& v) {
st.vec.assign(st.vec.size(), st.id);
map<int,vector<int>> oc;
for (int i = 0; i < v.size(); i++) {
oc[-v[i]].push_back(i);
}
vector<pair<int,int>> vec;
vec.push_back(make_pair(0, 1));
int used = pow(2, v.size() - 1);
for (auto& p: oc) {
vector<pair<int,int>> upd;
for (int i: p.second) {
pair<int,int64_t> node = st.query(i + 1, (int)v.size() - 1);
if (node.first == -1) {
node = make_pair(1, 1);
} else {
node.first += 1;
}
upd.push_back(node);
}
reverse(upd.begin(), upd.end());
for (int i: p.second) {
st.update(i, upd.back()), upd.pop_back();
}
pair<int,int64_t> g = st.id;
for (int i: p.second) {
g = st.merge(g, st.query(i, i));
}
vec.emplace_back(g);
}
return vec;
}
vector<pair<int,int>> lds (vector<int>& v) {
for (int i = 0; i < st.vec.size(); i++) {
st.vec[i] = st.id;
}
map<int,vector<int>> oc;
for (int i = 0; i < v.size(); i++) {
oc[v[i]].push_back(i);
}
vector<pair<int,int>> vec;
vec.push_back(make_pair(0, 1));
for (auto& p: oc) {
vector<pair<int,int64_t>> upd;
for (int i: p.second) {
pair<int,int64_t> node = st.query(i + 1, (int)v.size() - 1);
if (node.first == -1) {
node = make_pair(1, 1);
} else {
node.first += 1;
}
upd.push_back(node);
}
reverse(upd.begin(), upd.end());
for (int i: p.second) {
st.update(i, upd.back()), upd.pop_back();
}
vec.emplace_back(st.query(0, (int)v.size() - 1));
}
reverse(vec.begin(), vec.end());
return vec;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
st = SegmentTree(n);
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
auto a1 = lds(v);
auto a2 = lis(v);
int mx = 0;
int64_t cnt = 0;
for (int i = 0; i < a1.size(); i++) {
if (a1[i].first + a2[i].first > mx) {
mx = a1[i].first + a2[i].first;
cnt = ((int64_t)a1[i].second * (int64_t)a2[i].second) % MOD;
cnt %= MOD;
} else if (a1[i].first + a2[i].first == mx) {
cnt += ((int64_t)a1[i].second * (int64_t)a2[i].second) % MOD;
cnt %= MOD;
}
}
for (int i = 0; i < n - mx; i++) {
cnt *= 2;
cnt %= MOD;
}
if (cnt % 2 == 0) cnt /= 2;
else cnt = (cnt + MOD)/2 % MOD;
cout << mx << " " << cnt;
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||