# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
734020 | lorenzoferrari | Fish (IOI08_fish) | C++17 | 3064 ms | 44392 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "bits/stdc++.h"
using namespace std;
#define int long long
static constexpr int N = 5e5+5;
struct fish {
int l;
int g;
bool operator<(const fish& oth) {
return l < oth.l;
}
};
static int f[N]; // frq of each colour
static int ff[N]; // frq of each frq
set<int> s; // {j | ff[j] != 0}
vector<int> pw[N];
static void inc(int c, int m) {
if (ff[f[c]] == 1) {
s.erase(f[c]);
}
--ff[f[c]];
++f[c];
++ff[f[c]];
if (ff[f[c]] == 1) {
s.insert(f[c]);
}
pw[f[c]+1].emplace_back(pw[f[c]+1].back() * ((f[c]+1) % m) % m);
}
static int calc(int m) {
int ans = 1;
for (int j : s) {
ans = ans * pw[j+1][ff[j]] % m;
}
return ans;
}
signed main() {
for (int i = 0; i < N; ++i) {
pw[i].emplace_back(1);
}
int n; cin >> n;
int k; cin >> k;
int m; cin >> m;
vector<fish> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i].l >> a[i].g; --a[i].g;
}
sort(begin(a), end(a));
for (int i = 1; i < n; ++i) {
assert(a[i].l >= a[i-1].l);
}
vector<int> last(k);
for (int i = 0; i < n; ++i) {
last[a[i].g] = i;
}
int ans = 0;
vector<int> d(n);
vector<int> rs;
for (int r = 0, l = 0; r < n; ++r) {
if (last[a[r].g] != r) continue;
while (2*a[l].l <= a[r].l) {
inc(a[l].g, m);
++l;
continue;
if (last[a[l].g] < r) {
inc(a[l].g, m);
} else {
++d[last[a[l].g]];
}
++l;
}
while (d[r]--) {
inc(a[r].g, m);
}
rs.push_back(r);
int cur = 1;
for (int i : rs) {
cur = (cur * (f[a[i].g]+1)) % m;
}
ans += cur;
ans %= m;
// ans = (ans + calc(m)) % m;
}
cout << ans << "\n";
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |