oj.uz

답안 #617537

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
617537 2022-08-01T12:01:31 Z Awerar Calvinball championship (CEOI15_teams) C++17
60 / 100
 1000 ms 552 KB 
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <limits.h>
#include <math.h>
#include <chrono>
#include <queue>
#include <stack>
#include <algorithm>

using namespace std;

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define p2 pair<ll, ll>
#define p3 tuple<ll,ll,ll>
#define p4 vi
#define ip3 tuple<int,int,int>
#define ip4 tuple<int,int,int,int>
#define vp2 vector<p2>
#define vp3 vector<p3>
#define inf 2e9
#define linf 1e17

#define read(a) cin >> a
#define write(a) cout << (a) << "\n"
#define dread(type, a) type a; cin >> a
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#ifdef _DEBUG
#define deb __debugbreak();
#else
#define deb ;
#endif

#define rep(i, high) for (ll i = 0; i < high; i++)
#define repp(i, low, high) for (ll i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (ll i = high; i >= 0; i--)

#define readpush(type,vect) type temp; read(temp); vect.push_back(temp);
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#define readinsert(type,a) {type temp; read(temp); a.insert(temp);}
#define all(a) begin(a),end(a)
#define setcontains(set, x) (set.find(x) != set.end())
#define stringcontains(str, x) (str.find(x) != string::npos)
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)

#define ceildiv(x,y) ((x + y - 1) / y)
#define fract(a) (a-floor(a))
#define sign(a) ((a>0) ? 1 : -1)

auto Start = chrono::high_resolution_clock::now();

inline void fast()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
}

ll mod = 1000007;

int n;
vector<int> team;

/*vector<vector<vector<int>>> dp_table;

ll count_states(bool smaller, int k, int prev_max) {
    if(k >= n) return 1;

    int& ans = dp_table[smaller][k][prev_max];
    if(ans != -1) return ans;

    ll sum = 0;
    for(int i = 1; i <= prev_max + 1; i++) {
        if(i > team[k] && !smaller) continue;

        sum += count_states(smaller || i < team[k], k + 1, max(i, prev_max));
        sum %= mod;
    }

    ans = sum;
    return sum;
}*/

int main() {
    //fast();

    cin >> n;
    team.resize(n);

    for(int i = 0; i < n; i++) cin >> team[i];

    vector<vector<int>> old_dp_table(2, vector<int>(n + 1, 1));
    for(int k = n - 1; k >= 0; k--) {
        vector<vector<int>> dp_table(2, vector<int>(n + 1, -1));

        for(int smaller = 0; smaller <= 1; smaller++) {
            for(int prev_max = 0; prev_max < n; prev_max++) {
                int& ans = dp_table[smaller][prev_max];

                ll sum = 0;
                for(int i = 1; i <= prev_max + 1; i++) {
                    if(i > team[k] && !smaller) continue;

                    sum += old_dp_table[smaller || i < team[k]][max(i, prev_max)];
                    sum %= mod;
                }

                ans = sum;
            }
        }

        old_dp_table = dp_table;
    }

    cout << old_dp_table[false][0];
}

//1 1 1 1
//1 1 1 2
//1 1 2 1
//1 1 2 2
//1 1 2 3
//1 2 1 1
//1 2 1 2
//1 2 1 3
//1 2 2 1
//1 2 2 2
//1 2 2 3
//1 2 3 1
//1 2 3 2
//1 2 3 3
//1 2 3 4

Compilation message

teams.cpp:18: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   18 | #pragma GCC optimization ("O3")
      | 
teams.cpp:19: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   19 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 365 ms 292 KB Output is correct
2 Correct 353 ms 300 KB Output is correct
3 Correct 501 ms 288 KB Output is correct

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1076 ms 308 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1082 ms 552 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1085 ms 340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1079 ms 468 KB Time limit exceeded
2 Halted 0 ms 0 KB -