oj.uz

Submission #345889

# Submission time Handle Problem Language Result Execution time Memory
345889 2021-01-08T12:01:40 Z ACmachine Kangaroo (CEOI16_kangaroo) C++17
51 / 100
 1640 ms 524292 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

const int mod = (int)1e9+7;
struct Mint{
    int val;
    Mint(){ val = 0; }
    Mint(long long v){
        val = (-mod <= v && v < mod) ? v : v%mod;
        if(val < 0) val+= mod;
    }
    // operators
    Mint operator-(){return Mint(-val);}
    Mint& operator+=(const Mint& other){ val+=other.val; if(val >= mod) val-=mod; return *this;}
    Mint& operator-=(const Mint& other){ val-=other.val; if(val < 0) val+=mod; return *this;}
    Mint& operator*=(const Mint& other){ val=((long long)val*other.val)%mod; return *this;}
    friend Mint binpow(Mint a, long long p){
        Mint res(1);
        while(p > 0){
            if(p&1) res*=a; a*=a; p>>=1;
        }
        return res;
    }
    friend Mint inv(Mint a){ return binpow(a, mod-2); }
    Mint& operator/=(const Mint &other){ return (*this)*=inv(other);}
    
    friend Mint operator+(Mint a, const Mint& b){ return a+=b; }
    friend Mint operator-(Mint a, const Mint& b){ return a-=b; }
    friend Mint operator*(Mint a, const Mint& b){ return a*=b; }
    friend Mint operator/(Mint a, const Mint& b){ return a/=b; }
    
    bool operator==(const Mint &other){return val == other.val;}
    bool operator!=(const Mint &other){return val != other.val;}
    bool operator<(const Mint &other){return val < other.val;}
    // io
    friend ostream& operator<<(ostream &out, Mint &a){ return out << a.val; }
};
// try for 51 
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int n, cs, cf; cin >> n >> cs >> cf;
    cs--; cf--;
    if(cs > cf) swap(cs, cf);
    vector<vector<vector<Mint>>> A(n + 1, vector<vector<Mint>>(n, vector<Mint>(n, Mint(0))));
    vector<vector<vector<Mint>>> D(n + 1, vector<vector<Mint>>(n, vector<Mint>(n, Mint(0))));
    A[2][0][1] = Mint(1);
    D[2][1][0] = Mint(1);
    FOR(k, 3, n+1, 1){
        REP(i, k){
            REP(j, k){
                if(i == j) continue; 
                FOR(g, i, k - 1, 1){
                    if(i < j){
                        A[k][i][j] += D[k-1][g][j-1];
                    }
                    else{
                        A[k][i][j] += D[k-1][g][j];
                    } 
                }
                REP(g, i){
                    if(i < j){
                        D[k][i][j] += A[k - 1][g][j - 1];
                    }
                    else{
                        D[k][i][j] += A[k-1][g][j];
                    }
                } 
            }
        }
        /* dbg(k) */
        /* cout << "A:\n"; */
        /* REP(i, k){ */
        /*     REP(j, k){ */
        /*         cout << i << " " << j << " " << A[k][i][j] << "\n"; */
        /*     } */
        /* } */
        /* cout << "B:\n"; */
        /* REP(i, k){ */
        /*     REP(j, k){ */
        /*         cout << i << " " << j << " " << D[k][i][j] << "\n"; */
        /*     } */
        /* } */
    }
    Mint ans = A[n][cs][cf] + D[n][cs][cf];
    cout << ans << "\n";
    return 0;
}

Compilation message

kangaroo.cpp: In function 'Mint binpow(Mint, long long int)':
kangaroo.cpp:100:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  100 |             if(p&1) res*=a; a*=a; p>>=1;
      |             ^~
kangaroo.cpp:100:29: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  100 |             if(p&1) res*=a; a*=a; p>>=1;
      |                             ^

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 3 ms 1004 KB Output is correct
5 Correct 3 ms 1004 KB Output is correct
6 Correct 3 ms 1004 KB Output is correct
7 Correct 3 ms 876 KB Output is correct
8 Correct 4 ms 1004 KB Output is correct
9 Correct 3 ms 1004 KB Output is correct
10 Correct 3 ms 1004 KB Output is correct
11 Correct 3 ms 1004 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 3 ms 1004 KB Output is correct
5 Correct 3 ms 1004 KB Output is correct
6 Correct 3 ms 1004 KB Output is correct
7 Correct 3 ms 876 KB Output is correct
8 Correct 4 ms 1004 KB Output is correct
9 Correct 3 ms 1004 KB Output is correct
10 Correct 3 ms 1004 KB Output is correct
11 Correct 3 ms 1004 KB Output is correct
12 Correct 1606 ms 65912 KB Output is correct
13 Correct 1247 ms 55148 KB Output is correct
14 Correct 1618 ms 66028 KB Output is correct
15 Correct 1639 ms 66668 KB Output is correct
16 Correct 1611 ms 65992 KB Output is correct
17 Correct 1637 ms 66668 KB Output is correct
18 Correct 1024 ms 46928 KB Output is correct
19 Correct 1537 ms 63468 KB Output is correct
20 Correct 1640 ms 66688 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 3 ms 1004 KB Output is correct
5 Correct 3 ms 1004 KB Output is correct
6 Correct 3 ms 1004 KB Output is correct
7 Correct 3 ms 876 KB Output is correct
8 Correct 4 ms 1004 KB Output is correct
9 Correct 3 ms 1004 KB Output is correct
10 Correct 3 ms 1004 KB Output is correct
11 Correct 3 ms 1004 KB Output is correct
12 Correct 1606 ms 65912 KB Output is correct
13 Correct 1247 ms 55148 KB Output is correct
14 Correct 1618 ms 66028 KB Output is correct
15 Correct 1639 ms 66668 KB Output is correct
16 Correct 1611 ms 65992 KB Output is correct
17 Correct 1637 ms 66668 KB Output is correct
18 Correct 1024 ms 46928 KB Output is correct
19 Correct 1537 ms 63468 KB Output is correct
20 Correct 1640 ms 66688 KB Output is correct
21 Runtime error 325 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -