oj.uz

답안 #61533

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61533 2018-07-26T07:15:01 Z Mamnoon_Siam Calvinball championship (CEOI15_teams) C++17
70 / 100
 39 ms 8764 KB 
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>
// #include <bits/extc++.h>
using namespace std;

#define debug(s) cout << #s << " = " << s << endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a, val) memset(a, val, sizeof (a))
#define PB push_back
#define endl '\n'
typedef long long ll;

inline int myrand(int l, int r) {
	int ret = rand(); ret <<= 15; ret ^= rand();
	if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
	return ret;
}

template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
	return os<<"(" <<p.first<<", "<<p.second<<")"; }

typedef pair<int, int> ii;

template<typename T> using min_pq =
	std::priority_queue<T, vector<T>, greater<T> >;

//int dx[] = {-1, +0, +1, +0};
//int dy[] = {+0, +1, +0, -1};

#define less klsdjflk

const int maxn = 1005;
const int mod = 1000007;

int n;
vector<int> v;
int dp[maxn][maxn][2];

int get(int p, int mex, int less) {
	if(p == n) return 1;
	int &ret = dp[p][mex][less];
	if(ret != -1) return ret;
	ret = 0;
	if(!less) {
		ret += (1LL * min(mex - 1, v[p] - 1) * get(p + 1, mex, 1)) % mod;
		if(v[p] < mex) ret += get(p + 1, mex, 0);
		if(v[p] == mex) ret += get(p + 1, mex + 1, 0);
		if(v[p] > mex) ret += get(p + 1, mex + 1, 1);
	} else {
		ret += (1LL * (mex - 1) * get(p + 1, mex, less)) % mod;
		ret += get(p + 1, mex + 1, less);
	} ret %= mod;
	return ret;
}

int32_t main () {
	// freopen("in", "r", stdin);
    cin >> n;
    v.resize(n);
    for(int &b : v) cin >> b;
    memset(dp, -1, sizeof dp);
	cout << get(0, 1, 0) << endl;
}

Compilation message

teams.cpp: In function 'int myrand(int, int)':
teams.cpp:18:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
  ^~
teams.cpp:18:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
                          ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 8184 KB Output is correct
2 Correct 10 ms 8292 KB Output is correct
3 Correct 10 ms 8368 KB Output is correct
4 Correct 10 ms 8368 KB Output is correct
5 Correct 9 ms 8368 KB Output is correct
6 Correct 10 ms 8444 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8444 KB Output is correct
2 Correct 9 ms 8528 KB Output is correct
3 Correct 10 ms 8584 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 8620 KB Output is correct
2 Correct 13 ms 8620 KB Output is correct
3 Correct 15 ms 8624 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 8628 KB Output is correct
2 Correct 28 ms 8716 KB Output is correct
3 Correct 25 ms 8716 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 8716 KB Output isn't correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 26 ms 8716 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 39 ms 8764 KB Output isn't correct
2 Halted 0 ms 0 KB -