oj.uz

Submission #95860

# Submission time Handle Problem Language Result Execution time Memory
95860 2019-02-03T08:00:17 Z Kastanda Calvinball championship (CEOI15_teams) C++11
100 / 100
 237 ms 568 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 10004, Mod = 1000007;
int n, Mx, tot, A[N], C[N], dp[2][N];
int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
        scanf("%d", &A[i]), C[A[i]] ++, Mx = max(Mx, A[i]);
    tot = 1;
    for (int i = 0; i < N; i++)
        dp[0][i] = 1;
    for (int i = 1; i <= n; i++)
    {
        int w = i & 1;
        for (int j = 0; j < N; j++)
            dp[w][j] = (dp[!w][j + 1] + 1LL * dp[!w][j] * j) % Mod;
        C[A[n - i + 1]] --;
        if (!C[A[n - i + 1]])
            Mx --;
        for (int j = 1; j < A[n - i + 1]; j++)
        {
            tot = (tot + dp[!w][Mx]);
            if (tot >= Mod)
                tot -= Mod;
        }
    }
    return !printf("%d\n", tot);
}

Compilation message

teams.cpp: In function 'int main()':
teams.cpp:7:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
teams.cpp:9:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &A[i]), C[A[i]] ++, Mx = max(Mx, A[i]);
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
teams.cpp:17:37: warning: iteration 10003 invokes undefined behavior [-Waggressive-loop-optimizations]
             dp[w][j] = (dp[!w][j + 1] + 1LL * dp[!w][j] * j) % Mod;
                         ~~~~~~~~~~~~^
teams.cpp:16:27: note: within this loop
         for (int j = 0; j < N; j++)
                         ~~^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 376 KB Output is correct
2 Correct 11 ms 380 KB Output is correct
3 Correct 11 ms 376 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 376 KB Output is correct
2 Correct 22 ms 488 KB Output is correct
3 Correct 21 ms 504 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 237 ms 568 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 504 KB Output is correct
2 Correct 94 ms 480 KB Output is correct
3 Correct 109 ms 508 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 520 KB Output is correct
2 Correct 185 ms 508 KB Output is correct
3 Correct 236 ms 556 KB Output is correct