oj.uz

Submission #428854

# Submission time Handle Problem Language Result Execution time Memory
428854 2021-06-15T14:56:08 Z arayi Fish (IOI08_fish) C++17
5 / 100
 811 ms 14828 KB 
//Arayi
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>   
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#include <climits>
#include <cassert>
#include <chrono>
#include <random>
#include <complex>

#define fr first
#define sc second
#define MP make_pair
#define ad push_back
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
#define j1 jigglypuff
#define ld long double
#define itn int
#define pir pair<int, int>
#define all(x) (x).begin(), (x).end()
#define str string
#define enl endl
#define en endl
#define cd complex<long double>
#define vcd vector<cd>
#define vii vector<int>
#define vlli vector<lli>
using namespace std;

lli gcd(lli a, lli b) { return (b == 0LL ? a : gcd(b, a % b)); }
ld dist(ld x, ld y1, ld x2, ld y2)
{
    return sqrt((x - x2) * (x - x2) + (y1 - y2) * (y1 - y2));
}
lli S(lli a)
{
    return (a * (a + 1LL)) / 2;
}
mt19937 rnd(363542);
char vow[] = { 'a', 'e', 'i', 'o', 'u' };
int dx[] = { 0, -1, 0, 1, -1, -1, 1, 1, 0 };
int dy[] = { -1, 0, 1, 0, -1, 1, -1, 1, 0 };


const int N = 1e6 + 30;
lli mod = 1e9 + 7;
const ld pi = acos(-1);
const int T = 200;

lli bp(lli a, lli b = mod - 2LL)
{
    lli ret = 1;
    while (b)
    {
        if (b & 1) ret *= a, ret %= mod;
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return ret;
}
ostream& operator<<(ostream& c, pir a)
{
    c << a.fr << " " << a.sc;
    return c;
}
template<class T>
void maxi(T& a, T b)
{
    a = max(a, b);
}
template <class T>
void mini(T& a, T b)
{
    a = min(a, b);
}



int n, k;
pair<int, int> a[N];
lli qan[N], cl[N], ans, sm[N];
lli t1[4*N];
void upd1(int q, lli v, int l = 1, int r = k, int nd = 1)
{
    if(q > r || q < l) return;
    if(l == r)
    {
        t1[nd] = v;
        return;
    }
    int mid = (l + r) / 2;
    upd1(q, v, l, mid, nd*2);
    upd1(q, v, mid + 1, r, nd * 2 + 1);
    t1[nd] = (t1[nd*2] * t1[nd*2+1]) % mod;
}
int main()
{
    fastio;
//    freopen("input.in", "r", stdin);
    cin >> n >> k >> mod;
    for (int i = 0; i < n; i++) cin >> a[i].fr >> a[i].sc;
    sort(a,a+n);
    int i1 = -1;
    for (int i = 0; i < n; i++) if(a[i].fr*2 <= a[n-1].fr) qan[a[i].sc]++, i1 = i;
    for (int i = 1; i <= k; i++) upd1(i, qan[i] + 1);
    for (int i = 1; i <= k; i++)
    {
        upd1(i, 1);
        sm[i] = t1[1];
        upd1(i, qan[i] + 1);
    }
    for (int i = n - 1; i >= 0; i--)
    {
        vector<int> fp;
        while(i1 >= 0 && a[i1].fr*2 > a[i].fr)
        {
            qan[a[i1].sc]--;
            if(!cl[a[i1].sc]) upd1(a[i1].sc, qan[a[i1].sc] + 1), fp.ad(a[i1].sc); 
            i1--;
        }
        for(auto p : fp) 
        {
            upd1(p, 1);
            sm[p] = t1[1];
            upd1(p, qan[p] + 1);
        }
        if(cl[a[i].sc]) continue;
        ans += sm[a[i].sc], ans %= mod;
        ans += t1[1], ans %= mod;
        upd1(a[i].sc, 1);
        ans -= t1[1], ans %= mod, ans = (ans + mod) % mod;
        cl[a[i].sc] = 1;
    }
    cout << ans << endl;
    return 0;
}

/*
    __
  *(><)*
    \/ /
    ||/
  --||
    ||
    /\
   /  \
  /    \

*/

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 183 ms 5868 KB Output isn't correct

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 332 KB Output isn't correct

Subtask #9
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 82 ms 3692 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 456 KB Output is correct
2 Incorrect 3 ms 460 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 108 ms 4304 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 175 ms 6340 KB Output is correct
2 Incorrect 205 ms 11512 KB Output isn't correct

Subtask #13
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 171 ms 4468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 200 ms 5988 KB Output isn't correct

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 201 ms 6768 KB Output isn't correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 7384 KB Output is correct
2 Correct 336 ms 9436 KB Output is correct

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 494 ms 13032 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 508 ms 13212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 811 ms 14828 KB Output isn't correct
2 Halted 0 ms 0 KB -