oj.uz

Submission #102790

# Submission time Handle Problem Language Result Execution time Memory
102790 2019-03-27T14:10:44 Z CorneliuVadimTudor Boat (APIO16_boat) C++14
58 / 100
 2000 ms 4224 KB 
#include <bits/stdc++.h>
#define MAXN 1000
#define MAXG 2000

struct Event{
    int time, node, tip;
    bool operator < (const Event &aux) const{
        return time < aux.time;
    }
};
std::vector <Event> V;
std::set <int> S;

const int MOD = 1000000007;
int d[1 + MAXG][1 + MAXN];
int C[1 + MAXN], D[1 + MAXN];

inline int logPow(int a, int n){
    int p = 1;
    while(n){
        if(n % 2) p = 1LL * p * a % MOD;
        a = 1LL * a * a % MOD;
        n /= 2;
    }
    return p;
}

int main(){
    FILE*fi,*fo;
    //fi = fopen("a.in","r");
    //fo = fopen("a.out","w");
    fi = stdin;
    fo = stdout;

    int n;
    fscanf(fi,"%d", &n);
    for(int i = 1; i <= n; i++){
        int a, b;
        fscanf(fi,"%d%d", &a, &b);
        V.push_back({a, i, 1});
        V.push_back({b + 1, i, -1});
    }
    std::sort(V.begin(), V.end());

    int j = 0, group = 0;
    d[group][0] = 1;
    for(int i = 0; i < V.size(); i = j){
        j = i;
        while(j < V.size() && V[j].time == V[i].time){
            if(V[j].tip == 1) S.insert(V[j].node);
            else S.erase(V[j].node);
            j++;
        }
        if(!S.size()) continue;

        int len = V[j].time - V[i].time;
        C[0] = 1;
        for(int p = 1; p <= std::min((int)S.size(), len); p++){
            C[p] = 1LL * C[p - 1] * (len - p + 1) % MOD;
            C[p] = 1LL * C[p] * logPow(p, MOD - 2) % MOD;
        }

        for(int x = 0; x <= S.size(); x++){
            int Cxp = 1;
            D[x] = 0;
            for(int p = 1; p <= std::min(x, len); p++){
                Cxp = 1LL * Cxp * (x - p + 1) % MOD;
                Cxp = 1LL * Cxp * logPow(p, MOD - 2) % MOD;
                D[x] = (D[x] + 1LL * C[p] * Cxp % MOD) % MOD;
            }
        }

        group++;
        for(int prev = 0; prev <= n; prev++){
            auto next = S.begin();
            while(next != S.end() && *next <= prev) next++;

            int x = 0;
            while(next != S.end()){
                x++;
                d[group][*next] = (d[group][*next] + 1LL * d[group - 1][prev] * D[x]) % MOD;
                next++;
            }
        }

        auto next = S.begin();
        int prev = d[group][*next];
        next++;
        while(next != S.end()){
            int aux = d[group][*next];
            d[group][*next] = (d[group][*next] - prev + MOD) % MOD;
            prev = aux;
            next++;
        }

        for(int prev = 0; prev <= n; prev++)
            d[group][prev] = (d[group][prev] + d[group - 1][prev]) % MOD;
    }

    int ans = 0;
    for(int prev = 1; prev <= n; prev++)
        ans = (ans + d[group][prev]) % MOD;

    fprintf(fo,"%lld", ans);

    return 0;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:47:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < V.size(); i = j){
                    ~~^~~~~~~~~~
boat.cpp:49:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(j < V.size() && V[j].time == V[i].time){
               ~~^~~~~~~~~~
boat.cpp:63:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int x = 0; x <= S.size(); x++){
                        ~~^~~~~~~~~~~
boat.cpp:104:27: warning: format '%lld' expects argument of type 'long long int', but argument 3 has type 'int' [-Wformat=]
     fprintf(fo,"%lld", ans);
                           ^
boat.cpp:36:11: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf(fi,"%d", &n);
     ~~~~~~^~~~~~~~~~~~~
boat.cpp:39:15: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf(fi,"%d%d", &a, &b);
         ~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2304 KB Output is correct
2 Correct 7 ms 2304 KB Output is correct
3 Correct 6 ms 2304 KB Output is correct
4 Correct 8 ms 2304 KB Output is correct
5 Correct 7 ms 2304 KB Output is correct
6 Correct 7 ms 2304 KB Output is correct
7 Correct 7 ms 2304 KB Output is correct
8 Correct 8 ms 2304 KB Output is correct
9 Correct 8 ms 2304 KB Output is correct
10 Correct 8 ms 2304 KB Output is correct
11 Correct 7 ms 2260 KB Output is correct
12 Correct 7 ms 2304 KB Output is correct
13 Correct 8 ms 2304 KB Output is correct
14 Correct 7 ms 2304 KB Output is correct
15 Correct 9 ms 2304 KB Output is correct
16 Correct 4 ms 640 KB Output is correct
17 Correct 5 ms 768 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 6 ms 768 KB Output is correct
20 Correct 5 ms 768 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2304 KB Output is correct
2 Correct 7 ms 2304 KB Output is correct
3 Correct 6 ms 2304 KB Output is correct
4 Correct 8 ms 2304 KB Output is correct
5 Correct 7 ms 2304 KB Output is correct
6 Correct 7 ms 2304 KB Output is correct
7 Correct 7 ms 2304 KB Output is correct
8 Correct 8 ms 2304 KB Output is correct
9 Correct 8 ms 2304 KB Output is correct
10 Correct 8 ms 2304 KB Output is correct
11 Correct 7 ms 2260 KB Output is correct
12 Correct 7 ms 2304 KB Output is correct
13 Correct 8 ms 2304 KB Output is correct
14 Correct 7 ms 2304 KB Output is correct
15 Correct 9 ms 2304 KB Output is correct
16 Correct 4 ms 640 KB Output is correct
17 Correct 5 ms 768 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 6 ms 768 KB Output is correct
20 Correct 5 ms 768 KB Output is correct
21 Correct 585 ms 4088 KB Output is correct
22 Correct 604 ms 4176 KB Output is correct
23 Correct 490 ms 4088 KB Output is correct
24 Correct 550 ms 4088 KB Output is correct
25 Correct 641 ms 4028 KB Output is correct
26 Correct 899 ms 3832 KB Output is correct
27 Correct 757 ms 3960 KB Output is correct
28 Correct 876 ms 3908 KB Output is correct
29 Correct 809 ms 3848 KB Output is correct
30 Correct 12 ms 4224 KB Output is correct
31 Correct 16 ms 4224 KB Output is correct
32 Correct 13 ms 4224 KB Output is correct
33 Correct 16 ms 4224 KB Output is correct
34 Correct 14 ms 4224 KB Output is correct
35 Correct 13 ms 4224 KB Output is correct
36 Correct 13 ms 4224 KB Output is correct
37 Correct 11 ms 4224 KB Output is correct
38 Correct 13 ms 4224 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 1144 KB Output is correct
2 Correct 27 ms 1152 KB Output is correct
3 Correct 32 ms 1144 KB Output is correct
4 Correct 29 ms 1144 KB Output is correct
5 Correct 37 ms 1060 KB Output is correct
6 Correct 72 ms 1112 KB Output is correct
7 Correct 72 ms 1232 KB Output is correct
8 Correct 76 ms 1144 KB Output is correct
9 Correct 74 ms 1164 KB Output is correct
10 Correct 77 ms 1144 KB Output is correct
11 Correct 37 ms 1144 KB Output is correct
12 Correct 29 ms 1144 KB Output is correct
13 Correct 36 ms 1144 KB Output is correct
14 Correct 31 ms 1276 KB Output is correct
15 Correct 33 ms 1144 KB Output is correct
16 Correct 20 ms 896 KB Output is correct
17 Correct 18 ms 768 KB Output is correct
18 Correct 16 ms 768 KB Output is correct
19 Correct 15 ms 768 KB Output is correct
20 Correct 19 ms 800 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2304 KB Output is correct
2 Correct 7 ms 2304 KB Output is correct
3 Correct 6 ms 2304 KB Output is correct
4 Correct 8 ms 2304 KB Output is correct
5 Correct 7 ms 2304 KB Output is correct
6 Correct 7 ms 2304 KB Output is correct
7 Correct 7 ms 2304 KB Output is correct
8 Correct 8 ms 2304 KB Output is correct
9 Correct 8 ms 2304 KB Output is correct
10 Correct 8 ms 2304 KB Output is correct
11 Correct 7 ms 2260 KB Output is correct
12 Correct 7 ms 2304 KB Output is correct
13 Correct 8 ms 2304 KB Output is correct
14 Correct 7 ms 2304 KB Output is correct
15 Correct 9 ms 2304 KB Output is correct
16 Correct 4 ms 640 KB Output is correct
17 Correct 5 ms 768 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 6 ms 768 KB Output is correct
20 Correct 5 ms 768 KB Output is correct
21 Correct 585 ms 4088 KB Output is correct
22 Correct 604 ms 4176 KB Output is correct
23 Correct 490 ms 4088 KB Output is correct
24 Correct 550 ms 4088 KB Output is correct
25 Correct 641 ms 4028 KB Output is correct
26 Correct 899 ms 3832 KB Output is correct
27 Correct 757 ms 3960 KB Output is correct
28 Correct 876 ms 3908 KB Output is correct
29 Correct 809 ms 3848 KB Output is correct
30 Correct 12 ms 4224 KB Output is correct
31 Correct 16 ms 4224 KB Output is correct
32 Correct 13 ms 4224 KB Output is correct
33 Correct 16 ms 4224 KB Output is correct
34 Correct 14 ms 4224 KB Output is correct
35 Correct 13 ms 4224 KB Output is correct
36 Correct 13 ms 4224 KB Output is correct
37 Correct 11 ms 4224 KB Output is correct
38 Correct 13 ms 4224 KB Output is correct
39 Correct 36 ms 1144 KB Output is correct
40 Correct 27 ms 1152 KB Output is correct
41 Correct 32 ms 1144 KB Output is correct
42 Correct 29 ms 1144 KB Output is correct
43 Correct 37 ms 1060 KB Output is correct
44 Correct 72 ms 1112 KB Output is correct
45 Correct 72 ms 1232 KB Output is correct
46 Correct 76 ms 1144 KB Output is correct
47 Correct 74 ms 1164 KB Output is correct
48 Correct 77 ms 1144 KB Output is correct
49 Correct 37 ms 1144 KB Output is correct
50 Correct 29 ms 1144 KB Output is correct
51 Correct 36 ms 1144 KB Output is correct
52 Correct 31 ms 1276 KB Output is correct
53 Correct 33 ms 1144 KB Output is correct
54 Correct 20 ms 896 KB Output is correct
55 Correct 18 ms 768 KB Output is correct
56 Correct 16 ms 768 KB Output is correct
57 Correct 15 ms 768 KB Output is correct
58 Correct 19 ms 800 KB Output is correct
59 Execution timed out 2015 ms 2408 KB Time limit exceeded
60 Halted 0 ms 0 KB -