oj.uz

답안 #102792

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102792 2019-03-27T14:19:57 Z CorneliuVadimTudor Boat (APIO16_boat) C++14
58 / 100
 2000 ms 4324 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;
std::vector <int> X;

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;

        X.clear();
        for(auto y: S) X.push_back(y);

        int len = V[j].time - V[i].time;
        C[0] = 1;
        int lim = std::min((int)X.size(), len);
        for(int p = 1; p <= lim; 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 <= X.size(); x++){
            int Cxp = 1, lim = std::min(x, len);
            D[x] = 0;
            for(int p = 1; p <= lim; 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;
            }
        }

        group++;
        int first = 0;
        for(int prev = 0; prev <= n; prev++){
            while(first < X.size() && X[first] <= prev) first++;
            int ind = first;

            int x = 0;
            while(ind < X.size()){
                x++;
                d[group][X[ind]] = (d[group][X[ind]] + 1LL * d[group - 1][prev] * D[x]) % MOD;
                ind++;
            }
        }

        int ind = 0;
        int prev = d[group][X[ind]];
        ind++;
        while(ind < X.size()){
            int aux = d[group][X[ind]];
            d[group][X[ind]] = (d[group][X[ind]] - prev + MOD) % MOD;
            prev = aux;
            ind++;
        }

        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:48:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < V.size(); i = j){
                    ~~^~~~~~~~~~
boat.cpp:50:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(j < V.size() && V[j].time == V[i].time){
               ~~^~~~~~~~~~
boat.cpp:68:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int x = 0; x <= X.size(); x++){
                        ~~^~~~~~~~~~~
boat.cpp:81:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(first < X.size() && X[first] <= prev) first++;
                   ~~~~~~^~~~~~~~~~
boat.cpp:85:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(ind < X.size()){
                   ~~~~^~~~~~~~~~
boat.cpp:95:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(ind < X.size()){
               ~~~~^~~~~~~~~~
boat.cpp:110:27: warning: format '%lld' expects argument of type 'long long int', but argument 3 has type 'int' [-Wformat=]
     fprintf(fo,"%lld", ans);
                           ^
boat.cpp:37: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:40: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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2304 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 6 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 7 ms 2304 KB Output is correct
9 Correct 8 ms 2304 KB Output is correct
10 Correct 6 ms 2304 KB Output is correct
11 Correct 7 ms 2304 KB Output is correct
12 Correct 7 ms 2432 KB Output is correct
13 Correct 6 ms 2304 KB Output is correct
14 Correct 6 ms 2304 KB Output is correct
15 Correct 7 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 5 ms 768 KB Output is correct
20 Correct 3 ms 768 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2304 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 6 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 7 ms 2304 KB Output is correct
9 Correct 8 ms 2304 KB Output is correct
10 Correct 6 ms 2304 KB Output is correct
11 Correct 7 ms 2304 KB Output is correct
12 Correct 7 ms 2432 KB Output is correct
13 Correct 6 ms 2304 KB Output is correct
14 Correct 6 ms 2304 KB Output is correct
15 Correct 7 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 5 ms 768 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Correct 302 ms 3960 KB Output is correct
22 Correct 285 ms 3960 KB Output is correct
23 Correct 277 ms 4108 KB Output is correct
24 Correct 301 ms 3800 KB Output is correct
25 Correct 293 ms 3932 KB Output is correct
26 Correct 388 ms 3860 KB Output is correct
27 Correct 359 ms 3964 KB Output is correct
28 Correct 358 ms 3960 KB Output is correct
29 Correct 338 ms 3832 KB Output is correct
30 Correct 11 ms 4224 KB Output is correct
31 Correct 11 ms 4224 KB Output is correct
32 Correct 12 ms 4224 KB Output is correct
33 Correct 12 ms 4224 KB Output is correct
34 Correct 14 ms 4324 KB Output is correct
35 Correct 10 ms 4224 KB Output is correct
36 Correct 11 ms 4224 KB Output is correct
37 Correct 10 ms 4224 KB Output is correct
38 Correct 11 ms 4224 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 1152 KB Output is correct
2 Correct 23 ms 1144 KB Output is correct
3 Correct 29 ms 1144 KB Output is correct
4 Correct 29 ms 1272 KB Output is correct
5 Correct 34 ms 1144 KB Output is correct
6 Correct 66 ms 1144 KB Output is correct
7 Correct 65 ms 1144 KB Output is correct
8 Correct 67 ms 1272 KB Output is correct
9 Correct 66 ms 1116 KB Output is correct
10 Correct 68 ms 1144 KB Output is correct
11 Correct 35 ms 1144 KB Output is correct
12 Correct 24 ms 1144 KB Output is correct
13 Correct 33 ms 1076 KB Output is correct
14 Correct 33 ms 1116 KB Output is correct
15 Correct 33 ms 1148 KB Output is correct
16 Correct 16 ms 740 KB Output is correct
17 Correct 14 ms 768 KB Output is correct
18 Correct 15 ms 712 KB Output is correct
19 Correct 14 ms 768 KB Output is correct
20 Correct 18 ms 768 KB Output is correct

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2304 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 6 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 7 ms 2304 KB Output is correct
9 Correct 8 ms 2304 KB Output is correct
10 Correct 6 ms 2304 KB Output is correct
11 Correct 7 ms 2304 KB Output is correct
12 Correct 7 ms 2432 KB Output is correct
13 Correct 6 ms 2304 KB Output is correct
14 Correct 6 ms 2304 KB Output is correct
15 Correct 7 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 5 ms 768 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Correct 302 ms 3960 KB Output is correct
22 Correct 285 ms 3960 KB Output is correct
23 Correct 277 ms 4108 KB Output is correct
24 Correct 301 ms 3800 KB Output is correct
25 Correct 293 ms 3932 KB Output is correct
26 Correct 388 ms 3860 KB Output is correct
27 Correct 359 ms 3964 KB Output is correct
28 Correct 358 ms 3960 KB Output is correct
29 Correct 338 ms 3832 KB Output is correct
30 Correct 11 ms 4224 KB Output is correct
31 Correct 11 ms 4224 KB Output is correct
32 Correct 12 ms 4224 KB Output is correct
33 Correct 12 ms 4224 KB Output is correct
34 Correct 14 ms 4324 KB Output is correct
35 Correct 10 ms 4224 KB Output is correct
36 Correct 11 ms 4224 KB Output is correct
37 Correct 10 ms 4224 KB Output is correct
38 Correct 11 ms 4224 KB Output is correct
39 Correct 31 ms 1152 KB Output is correct
40 Correct 23 ms 1144 KB Output is correct
41 Correct 29 ms 1144 KB Output is correct
42 Correct 29 ms 1272 KB Output is correct
43 Correct 34 ms 1144 KB Output is correct
44 Correct 66 ms 1144 KB Output is correct
45 Correct 65 ms 1144 KB Output is correct
46 Correct 67 ms 1272 KB Output is correct
47 Correct 66 ms 1116 KB Output is correct
48 Correct 68 ms 1144 KB Output is correct
49 Correct 35 ms 1144 KB Output is correct
50 Correct 24 ms 1144 KB Output is correct
51 Correct 33 ms 1076 KB Output is correct
52 Correct 33 ms 1116 KB Output is correct
53 Correct 33 ms 1148 KB Output is correct
54 Correct 16 ms 740 KB Output is correct
55 Correct 14 ms 768 KB Output is correct
56 Correct 15 ms 712 KB Output is correct
57 Correct 14 ms 768 KB Output is correct
58 Correct 18 ms 768 KB Output is correct
59 Execution timed out 2052 ms 2812 KB Time limit exceeded
60 Halted 0 ms 0 KB -