제출 #527159

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
527159		squiddy	Calvinball championship (CEOI15_teams)	C++14	0 / 100	7 ms	4556 KiB

teams

#include <bits/stdc++.h>

using namespace std;
#define FOR(v, s, e) for (int v = s; v < e; v++)
#define FOR_REV(v, s, e) for (int v = e - 1; v >= s; v--)

#define MOD 1000007
int n, ans, cmax = 1;
int pf[105][105][105];

int main() {
	cin >> n;
	if (n > 100) return 1;
	FOR(i, 0, n) {
		FOR(k, 0, n) 
			pf[0][i][k + 1] = pf[0][i][k] + 1;
	}
	FOR(i, 1, n) {
		FOR(j, 0, n) {
			FOR(k, 0, n) {

				pf[i][j][k + 1] = (pf[i][j][k] + pf[i - 1][j][j + 1] + pf[i - 1][j + 1][j + 2] - pf[i - 1][j + 1][j + 1]) % MOD;
			}
		}
	}
	FOR_REV(i, 0, n) {
		int cval;
		cin >> cval;
		cout << pf[i][cmax - 1][cval - 1] << '\n';
		ans = (ans + pf[i][cmax - 1][cval - 1]) % MOD;
		cmax = max(cmax, cval);
	}
	cout << (ans + 1) % MOD;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10