oj.uz

Submission #102786

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

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 long long MOD = 1000000007;
long long d[1 + MAXG][1 + MAXN];
long long C[1 + MAXN], D[1 + MAXN];

inline long long logPow(long long a, long long n){
    long long p = 1;
    while(n){
        if(n % 2) p = p * a % MOD;
        a = 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] = C[p - 1] * (len - p + 1) % MOD;
            C[p] = C[p] * logPow(p, MOD - 2) % MOD;
        }

        for(int x = 0; x <= S.size(); x++){
            long long Cxp = 1;
            D[x] = 0;
            for(int p = 1; p <= std::min(x, len); p++){
                Cxp = Cxp * (x - p + 1) % MOD;
                Cxp = Cxp * logPow(p, MOD - 2) % MOD;
                D[x] = (D[x] + 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] + d[group - 1][prev] * D[x]) % MOD;
                next++;
            }
        }

        auto next = S.begin();
        long long prev = d[group][*next];
        next++;
        while(next != S.end()){
            long long 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;
    }

    long long 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: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 8 ms 2304 KB Output is correct
2 Correct 9 ms 2304 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 7 ms 2304 KB Output is correct
5 Correct 6 ms 2304 KB Output is correct
6 Correct 6 ms 2304 KB Output is correct
7 Correct 6 ms 2304 KB Output is correct
8 Correct 6 ms 2304 KB Output is correct
9 Correct 7 ms 2304 KB Output is correct
10 Correct 7 ms 2304 KB Output is correct
11 Correct 6 ms 2304 KB Output is correct
12 Correct 6 ms 2304 KB Output is correct
13 Correct 6 ms 2304 KB Output is correct
14 Correct 8 ms 2304 KB Output is correct
15 Correct 6 ms 2304 KB Output is correct
16 Correct 4 ms 640 KB Output is correct
17 Correct 4 ms 768 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 4 ms 768 KB Output is correct
20 Correct 5 ms 640 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2304 KB Output is correct
2 Correct 9 ms 2304 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 7 ms 2304 KB Output is correct
5 Correct 6 ms 2304 KB Output is correct
6 Correct 6 ms 2304 KB Output is correct
7 Correct 6 ms 2304 KB Output is correct
8 Correct 6 ms 2304 KB Output is correct
9 Correct 7 ms 2304 KB Output is correct
10 Correct 7 ms 2304 KB Output is correct
11 Correct 6 ms 2304 KB Output is correct
12 Correct 6 ms 2304 KB Output is correct
13 Correct 6 ms 2304 KB Output is correct
14 Correct 8 ms 2304 KB Output is correct
15 Correct 6 ms 2304 KB Output is correct
16 Correct 4 ms 640 KB Output is correct
17 Correct 4 ms 768 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 4 ms 768 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 567 ms 4012 KB Output is correct
22 Correct 516 ms 4064 KB Output is correct
23 Correct 531 ms 3872 KB Output is correct
24 Correct 548 ms 3948 KB Output is correct
25 Correct 572 ms 3932 KB Output is correct
26 Correct 776 ms 3776 KB Output is correct
27 Correct 765 ms 3960 KB Output is correct
28 Correct 761 ms 3836 KB Output is correct
29 Correct 790 ms 3828 KB Output is correct
30 Correct 12 ms 4224 KB Output is correct
31 Correct 11 ms 4224 KB Output is correct
32 Correct 16 ms 4224 KB Output is correct
33 Correct 11 ms 4224 KB Output is correct
34 Correct 16 ms 4224 KB Output is correct
35 Correct 17 ms 4224 KB Output is correct
36 Correct 16 ms 4352 KB Output is correct
37 Correct 12 ms 4224 KB Output is correct
38 Correct 12 ms 4224 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 1152 KB Output is correct
2 Correct 23 ms 1152 KB Output is correct
3 Correct 26 ms 1144 KB Output is correct
4 Correct 28 ms 1152 KB Output is correct
5 Correct 33 ms 1144 KB Output is correct
6 Correct 58 ms 1144 KB Output is correct
7 Correct 65 ms 1116 KB Output is correct
8 Correct 65 ms 1144 KB Output is correct
9 Correct 60 ms 1104 KB Output is correct
10 Correct 64 ms 1144 KB Output is correct
11 Correct 34 ms 1144 KB Output is correct
12 Correct 21 ms 1144 KB Output is correct
13 Correct 28 ms 1152 KB Output is correct
14 Correct 27 ms 1152 KB Output is correct
15 Correct 32 ms 1144 KB Output is correct
16 Correct 15 ms 768 KB Output is correct
17 Correct 13 ms 768 KB Output is correct
18 Correct 16 ms 768 KB Output is correct
19 Correct 14 ms 768 KB Output is correct
20 Correct 17 ms 768 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2304 KB Output is correct
2 Correct 9 ms 2304 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 7 ms 2304 KB Output is correct
5 Correct 6 ms 2304 KB Output is correct
6 Correct 6 ms 2304 KB Output is correct
7 Correct 6 ms 2304 KB Output is correct
8 Correct 6 ms 2304 KB Output is correct
9 Correct 7 ms 2304 KB Output is correct
10 Correct 7 ms 2304 KB Output is correct
11 Correct 6 ms 2304 KB Output is correct
12 Correct 6 ms 2304 KB Output is correct
13 Correct 6 ms 2304 KB Output is correct
14 Correct 8 ms 2304 KB Output is correct
15 Correct 6 ms 2304 KB Output is correct
16 Correct 4 ms 640 KB Output is correct
17 Correct 4 ms 768 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 4 ms 768 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 567 ms 4012 KB Output is correct
22 Correct 516 ms 4064 KB Output is correct
23 Correct 531 ms 3872 KB Output is correct
24 Correct 548 ms 3948 KB Output is correct
25 Correct 572 ms 3932 KB Output is correct
26 Correct 776 ms 3776 KB Output is correct
27 Correct 765 ms 3960 KB Output is correct
28 Correct 761 ms 3836 KB Output is correct
29 Correct 790 ms 3828 KB Output is correct
30 Correct 12 ms 4224 KB Output is correct
31 Correct 11 ms 4224 KB Output is correct
32 Correct 16 ms 4224 KB Output is correct
33 Correct 11 ms 4224 KB Output is correct
34 Correct 16 ms 4224 KB Output is correct
35 Correct 17 ms 4224 KB Output is correct
36 Correct 16 ms 4352 KB Output is correct
37 Correct 12 ms 4224 KB Output is correct
38 Correct 12 ms 4224 KB Output is correct
39 Correct 29 ms 1152 KB Output is correct
40 Correct 23 ms 1152 KB Output is correct
41 Correct 26 ms 1144 KB Output is correct
42 Correct 28 ms 1152 KB Output is correct
43 Correct 33 ms 1144 KB Output is correct
44 Correct 58 ms 1144 KB Output is correct
45 Correct 65 ms 1116 KB Output is correct
46 Correct 65 ms 1144 KB Output is correct
47 Correct 60 ms 1104 KB Output is correct
48 Correct 64 ms 1144 KB Output is correct
49 Correct 34 ms 1144 KB Output is correct
50 Correct 21 ms 1144 KB Output is correct
51 Correct 28 ms 1152 KB Output is correct
52 Correct 27 ms 1152 KB Output is correct
53 Correct 32 ms 1144 KB Output is correct
54 Correct 15 ms 768 KB Output is correct
55 Correct 13 ms 768 KB Output is correct
56 Correct 16 ms 768 KB Output is correct
57 Correct 14 ms 768 KB Output is correct
58 Correct 17 ms 768 KB Output is correct
59 Execution timed out 2062 ms 2768 KB Time limit exceeded
60 Halted 0 ms 0 KB -