oj.uz

답안 #314982

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
314982 2020-10-21T19:24:40 Z mohamedsobhi777 Calvinball championship (CEOI15_teams) C++14
100 / 100
 413 ms 632 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("-Ofast")
//#pragma GCC optimize("trapv")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")

#define I inline void
#define S struct
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define pll pair<ll, ll>

using namespace std;
using ll = long long;
using ld = long double;

const int N = 10000 + 7, mod = 1e6 + 7;
const ll inf = 2e18;

// How interesting!

int n;
int a[N], b[N];
int Max;
int c[N][N];

int mul(int x, int y) { return 1ll * x * y % mod; }
int add(int x, int y) { return (x + y) >= mod ? x + y - mod : x + y; }

int dp[N], ndp[N];

void dodp()
{

        for (int i = 0; i <= n; ++i)
        {
                ndp[i] = add(dp[i + 1], mul(i, dp[i]));
        }
        for (int i = 0; i <= n; ++i)
        {
                dp[i] = ndp[i];
        }
}

int main()
{
        ios_base::sync_with_stdio(0);
        cin.tie(0);
        //freopen("in.in", "r", stdin);

        cin >> n;
        for (int i = 0; i < n; ++i)
                dp[i] = 1;
        for (int i = 0; i < n; ++i)
        {
                cin >> a[i];
                if (i)
                        b[i] = max(b[i - 1], a[i]);
                else
                        b[i] = a[i];
        }
        int ans = 0;
        for (int i = n - 1; ~i; --i)
        {
                int x = a[i];
                for (int j = 1; j < x; ++j)
                {
                        int k = (i ? b[i - 1] : 0);
                        ans = add(ans, dp[max(j, i ? b[i - 1] : 0)]);
                }
                Max = max(Max, x);
                dodp();
        }
        cout << add(ans, 1);
        return 0;
}

/*
        - bounds sir (segtree = 4N, eulerTour = 2N, ...)
        - a variable defined twice?
        - will overflow?
        - is it a good complexity?
        - don't mess up indices (0-indexed vs 1-indexed)
        - reset everything between testcases. 
*/

Compilation message

teams.cpp: In function 'int main()':
teams.cpp:71:29: warning: unused variable 'k' [-Wunused-variable]
   71 |                         int k = (i ? b[i - 1] : 0);
      |                             ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 406 ms 632 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 89 ms 384 KB Output is correct
2 Correct 85 ms 384 KB Output is correct
3 Correct 104 ms 504 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 339 ms 560 KB Output is correct
2 Correct 343 ms 632 KB Output is correct
3 Correct 413 ms 632 KB Output is correct