# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
203466 |
2020-02-20T20:08:32 Z |
kostia244 |
ICC (CEOI16_icc) |
C++17 |
|
0 ms |
0 KB |
//#define _GLIBCXX_DEBUG
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,ssse3,fma,tune=native")
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pi = pair<int, int>;
using vpi = vector<pi>;
const int maxn = 204, mod = 1e9 + 7;
int n, a, b, dp[maxn*maxn*maxn*2];
inline void add(int &a, int &b) {
a += b;
if(a>=mod) a-=mod;
}
#define state(x,y,z,k) (maxn*maxn*2*(x) + maxn*2*(y) + 2*(z) + (k))
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> a >> b;
dp[state(1,1,1,0)] = dp[state(1,1,1,1)] = 1;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= i; j++) {
for(int k = 1; k <= i; k++) {
for(int D = 0; D < 2; D++) {
for(int q = 1; q <= i+1; q++) {
if((k+(k>=q)<q)^D) {
add(dp[state(i+1,j+(j>=q),q,D^1)], dp[state(i,j,k,D)]);
}
}
}
}
}
}
cout << (dp[state(n,a,b,0)]+dp[state(n,a,b,1)])%mod;
}
Compilation message
/tmp/ccDg3ahG.o: In function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/ccGQ2d0J.o:icc.cpp:(.text.startup+0x0): first defined here
/tmp/ccDg3ahG.o: In function `main':
grader.cpp:(.text.startup+0x1d): undefined reference to `run'
collect2: error: ld returned 1 exit status