oj.uz

Submission #887018

# Submission time Handle Problem Language Result Execution time Memory
887018 2023-12-13T13:07:09 Z Kutan Kangaroo (CEOI16_kangaroo) C++14
51 / 100
 116 ms 190800 KB 
// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
 
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));
 
const int INF = 1e9 , mod = 1e9 + 7;
 
template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }
 
template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}
 
template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }
 
template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }
 
template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }
 
template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }
 
#define PROB "a"
void file(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp","r",stdin);
        freopen(PROB".out","w",stdout);
    }
}
void sinh_(){
//    srand(time(0));
//    freopen(PROB".inp" , "w" , stdout);
//    int n;
}
 
typedef long long ll;
typedef double db;
const int N = 202;
int A[N][N][N] = {}, D[N][N][N] = {};
int pre[N][N][N] = {}, suf[N][N][N] = {};
int n, a, b;

void readip(){
    cin >> n >> a >> b;
}
 
void solve(){   
    A[1][1][1] = D[1][1][1] = 1;
    suf[1][1][1] = pre[1][1][1] = 1;

    for (int len = 2; len <= n; ++len) {
        for (int i = 1; i <= len; ++i) for (int j = 1; j <= len; ++j) {
            if (i != j) {
                A[len][i][j] = suf[len - 1][i][j - (j > i)];
                D[len][i][j] = pre[len - 1][i - 1][j - (j > i)];
            }
            pre[len][i][j] = (pre[len][i - 1][j] + A[len][i][j]) % mod;
        }

        for (int i = len; i > 0; --i) for (int j = 1; j <= len; ++j)
            suf[len][i][j] = (D[len][i][j] + suf[len][i + 1][j]) % mod;
        
    }
    cout << (A[n][a][b] + D[n][a][b]) % mod;
}
 
int main(){
    sinh_();
    io_faster
    file();
    int t = 1;
//    cin >> t;
    while (t--){
        readip();
        solve();
    }
}

Compilation message

kangaroo.cpp: In function 'void file()':
kangaroo.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen(PROB".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
kangaroo.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(PROB".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 11612 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 3 ms 14796 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 11612 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 3 ms 14796 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 44 ms 93776 KB Output is correct
13 Correct 34 ms 89044 KB Output is correct
14 Correct 39 ms 93744 KB Output is correct
15 Correct 38 ms 94028 KB Output is correct
16 Correct 40 ms 93908 KB Output is correct
17 Correct 40 ms 93944 KB Output is correct
18 Correct 31 ms 84344 KB Output is correct
19 Correct 39 ms 93388 KB Output is correct
20 Correct 39 ms 94024 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 11612 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 3 ms 14796 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 44 ms 93776 KB Output is correct
13 Correct 34 ms 89044 KB Output is correct
14 Correct 39 ms 93744 KB Output is correct
15 Correct 38 ms 94028 KB Output is correct
16 Correct 40 ms 93908 KB Output is correct
17 Correct 40 ms 93944 KB Output is correct
18 Correct 31 ms 84344 KB Output is correct
19 Correct 39 ms 93388 KB Output is correct
20 Correct 39 ms 94024 KB Output is correct
21 Runtime error 116 ms 190800 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -