oj.uz

Submission #389827

# Submission time Handle Problem Language Result Execution time Memory
389827 2021-04-14T15:06:06 Z osaaateiasavtnl Fish (IOI08_fish) C++14
56 / 100
 3000 ms 65540 KB 
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cerr << #x << ": " << x << '\n';
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORN(i, n) for (int i = 1; i <= n; ++i)
#define pb push_back
#define trav(a, x) for (auto& a : x)
using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> void re(V<T>& x) { 
    trav(a, x)
        cin >> a;
}
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
 
const int N = 5e5+7;
int n, k, MOD;
int tree[N << 2];
void setpoint(int v, int l, int r, int i, int x) {
    if (l == r) {
        tree[v] = x;
        return;
    }
    int m = (l + r) / 2;
    if (i <= m) {
        setpoint(v * 2 + 1, l, m, i, x);
    }
    else {
        setpoint(v * 2 + 2, m + 1, r, i, x);
    }
    tree[v] = tree[v * 2 + 1] * tree[v * 2 + 2] % MOD;
}
void setpoint(int i, int x) {
    x %= MOD;
    setpoint(0, 1, k, i, x);
}
 
vi who[N];

signed main() {
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    cin >> n >> k >> MOD;
 
    FOR (i, (N << 2)) {
        tree[i] = 1;    
    }
 
    const int INF = 2e9;
    vi r(k + 1, -INF);
    V <vi> sc;
    FOR (i, n) {
        int sz, c;
        cin >> sz >> c;
        sc.app({2 * sz, 0, c});
        ckmax(r[c], sz);
        who[c].app(sz);
    }
    FORN (i, k) {
        sc.app({r[i], 1, i});
    }
    sort(all(sc));
    vi used(k + 1), cur(k + 1);
    int ans = 0;
    trav (e, sc) {
        int col = e[2];
        if (e[1] == 0) {
            cur[col]++;
            if (used[col]) {
                setpoint(col, cur[col] + 1);
            }
        }
        else {
            used[col] = 1;
            setpoint(col, cur[col] + 1);
            ans += tree[0];
            ans %= MOD;
        }
    }

    FORN (c, k) {
        sort(all(who[c]));
    }

    FORN (c, k) {
        int eat = 0;
        while (2 * who[c][eat] <= r[c]) {
            eat++;
        }
        int alive = who[c][eat];
        int L = 1, R = 1;
        FORN (i, k) {
            if (i != c) {
                if (r[i] < alive * 2) {
                    int ptr = 0;
                    while (ptr < who[i].size() && who[i][ptr] * 2 <= r[c]) {
                        ptr++;
                    }
                    if (mp(r[i], i) < mp(r[c], c)) {
                        L *= ptr + 1;
                        L %= MOD;
                    }
                    else {
                        R *= ptr + 1;
                        R %= MOD;
                    }
                }
            }
        }
        ans += L * (R + MOD - 1);
        ans %= MOD;
    }

    cout << ans << endl;
}

Compilation message

fish.cpp: In function 'int main()':
fish.cpp:164:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  164 |                     while (ptr < who[i].size() && who[i][ptr] * 2 <= r[c]) {
      |                            ~~~~^~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19868 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19788 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19828 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19788 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19932 KB Output is correct
2 Correct 13 ms 19948 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19836 KB Output is correct
2 Correct 547 ms 55256 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19916 KB Output is correct

Subtask #8
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 20100 KB Output is correct

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 34344 KB Output is correct
2 Correct 260 ms 38056 KB Output is correct

Subtask #10
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 20284 KB Output is correct
2 Correct 32 ms 20272 KB Output is correct
3 Correct 54 ms 20312 KB Output is correct

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 547 ms 45696 KB Output is correct
2 Incorrect 1544 ms 56444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1090 ms 56156 KB Output is correct
2 Correct 1307 ms 57496 KB Output is correct

Subtask #13
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 758 ms 46156 KB Output is correct
2 Execution timed out 3094 ms 57464 KB Time limit exceeded

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3054 ms 54216 KB Time limit exceeded

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3086 ms 59240 KB Time limit exceeded

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3100 ms 53648 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 255 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 188 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 301 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -