oj.uz

Submission #62668

# Submission time Handle Problem Language Result Execution time Memory
62668 2018-07-29T17:41:05 Z qkxwsm Asceticism (JOI18_asceticism) C++11
100 / 100
 23 ms 2352 KB 
/*
PROG: source
LANG: C++11
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
 */
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
    int operator()(int x) const
	{
		x ^= (x >> 20) ^ (x >> 12);
    	return x ^ (x >> 7) ^ (x >> 4);
	}
	int operator()(long long x) const
	{
		return x ^ (x >> 32);
	}
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T>
T normalize(T x, T mod = 1000000007)
{
	return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
	return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N, K;
ll fact[MAXN], ifact[MAXN];
ll ans;

ll expo(ll a, ll e)
{
    if (e == 1)
    {
        return a;
    }
    ll was = expo(a, e / 2);
    if (e % 2)
    {
        return was * was % INF * a % INF;
    }
    return was * was % INF;
}
int32_t main()
{
	ios_base::sync_with_stdio(0);
	srand(time(0));
	//	cout << fixed << setprecision(10);
	//	cerr << fixed << setprecision(10);
	if (fopen("input.in", "r"))
	{
		freopen ("input.in", "r", stdin);
		freopen ("output.out", "w", stdout);
	}
    cin >> N >> K;
    //there are K - 1 occurrences of A[i - 1] > A[i];
    //divide up N into K chains, then split up the #s
    fact[0] = 1;
    for (int i = 1; i < MAXN; i++)
    {
        fact[i] = fact[i - 1] * i;
        fact[i] %= INF;
    }
    ifact[MAXN - 1] = 262577793;
    for (int i = MAXN - 2; i >= 0; i--)
    {
        ifact[i] = ifact[i + 1] * (i + 1);
        ifact[i] %= INF;
    }
    K--;
    for (int i = 0; i <= K; i++)
    {
        ll net;
        if (i % 2)
        {
            net = -1;
        }
        else
        {
            net = 1;
        }
        ans += net * fact[N + 1] * ifact[i] % INF * ifact[N + 1 - i] % INF * expo(K + 1 - i, N) % INF;
        ans %= INF; ans += INF; ans %= INF;
    }
    cout << ans << '\n';
	//	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

Compilation message

asceticism.cpp: In function 'int32_t main()':
asceticism.cpp:168:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("input.in", "r", stdin);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
asceticism.cpp:169:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("output.out", "w", stdout);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1912 KB Output is correct
2 Correct 8 ms 2028 KB Output is correct
3 Correct 6 ms 2088 KB Output is correct
4 Correct 7 ms 2088 KB Output is correct
5 Correct 6 ms 2132 KB Output is correct
6 Correct 6 ms 2132 KB Output is correct
7 Correct 6 ms 2132 KB Output is correct
8 Correct 5 ms 2160 KB Output is correct
9 Correct 7 ms 2164 KB Output is correct
10 Correct 6 ms 2168 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1912 KB Output is correct
2 Correct 8 ms 2028 KB Output is correct
3 Correct 6 ms 2088 KB Output is correct
4 Correct 7 ms 2088 KB Output is correct
5 Correct 6 ms 2132 KB Output is correct
6 Correct 6 ms 2132 KB Output is correct
7 Correct 6 ms 2132 KB Output is correct
8 Correct 5 ms 2160 KB Output is correct
9 Correct 7 ms 2164 KB Output is correct
10 Correct 6 ms 2168 KB Output is correct
11 Correct 7 ms 2172 KB Output is correct
12 Correct 5 ms 2196 KB Output is correct
13 Correct 6 ms 2196 KB Output is correct
14 Correct 6 ms 2312 KB Output is correct
15 Correct 5 ms 2312 KB Output is correct
16 Correct 6 ms 2312 KB Output is correct
17 Correct 6 ms 2312 KB Output is correct
18 Correct 5 ms 2312 KB Output is correct
19 Correct 6 ms 2312 KB Output is correct
20 Correct 6 ms 2312 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1912 KB Output is correct
2 Correct 8 ms 2028 KB Output is correct
3 Correct 6 ms 2088 KB Output is correct
4 Correct 7 ms 2088 KB Output is correct
5 Correct 6 ms 2132 KB Output is correct
6 Correct 6 ms 2132 KB Output is correct
7 Correct 6 ms 2132 KB Output is correct
8 Correct 5 ms 2160 KB Output is correct
9 Correct 7 ms 2164 KB Output is correct
10 Correct 6 ms 2168 KB Output is correct
11 Correct 7 ms 2172 KB Output is correct
12 Correct 5 ms 2196 KB Output is correct
13 Correct 6 ms 2196 KB Output is correct
14 Correct 6 ms 2312 KB Output is correct
15 Correct 5 ms 2312 KB Output is correct
16 Correct 6 ms 2312 KB Output is correct
17 Correct 6 ms 2312 KB Output is correct
18 Correct 5 ms 2312 KB Output is correct
19 Correct 6 ms 2312 KB Output is correct
20 Correct 6 ms 2312 KB Output is correct
21 Correct 5 ms 2312 KB Output is correct
22 Correct 5 ms 2312 KB Output is correct
23 Correct 6 ms 2312 KB Output is correct
24 Correct 5 ms 2312 KB Output is correct
25 Correct 6 ms 2312 KB Output is correct
26 Correct 6 ms 2312 KB Output is correct
27 Correct 3 ms 2312 KB Output is correct
28 Correct 6 ms 2312 KB Output is correct
29 Correct 5 ms 2312 KB Output is correct
30 Correct 6 ms 2312 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1912 KB Output is correct
2 Correct 8 ms 2028 KB Output is correct
3 Correct 6 ms 2088 KB Output is correct
4 Correct 7 ms 2088 KB Output is correct
5 Correct 6 ms 2132 KB Output is correct
6 Correct 6 ms 2132 KB Output is correct
7 Correct 6 ms 2132 KB Output is correct
8 Correct 5 ms 2160 KB Output is correct
9 Correct 7 ms 2164 KB Output is correct
10 Correct 6 ms 2168 KB Output is correct
11 Correct 7 ms 2172 KB Output is correct
12 Correct 5 ms 2196 KB Output is correct
13 Correct 6 ms 2196 KB Output is correct
14 Correct 6 ms 2312 KB Output is correct
15 Correct 5 ms 2312 KB Output is correct
16 Correct 6 ms 2312 KB Output is correct
17 Correct 6 ms 2312 KB Output is correct
18 Correct 5 ms 2312 KB Output is correct
19 Correct 6 ms 2312 KB Output is correct
20 Correct 6 ms 2312 KB Output is correct
21 Correct 5 ms 2312 KB Output is correct
22 Correct 5 ms 2312 KB Output is correct
23 Correct 6 ms 2312 KB Output is correct
24 Correct 5 ms 2312 KB Output is correct
25 Correct 6 ms 2312 KB Output is correct
26 Correct 6 ms 2312 KB Output is correct
27 Correct 3 ms 2312 KB Output is correct
28 Correct 6 ms 2312 KB Output is correct
29 Correct 5 ms 2312 KB Output is correct
30 Correct 6 ms 2312 KB Output is correct
31 Correct 5 ms 2312 KB Output is correct
32 Correct 6 ms 2352 KB Output is correct
33 Correct 7 ms 2352 KB Output is correct
34 Correct 7 ms 2352 KB Output is correct
35 Correct 19 ms 2352 KB Output is correct
36 Correct 23 ms 2352 KB Output is correct
37 Correct 22 ms 2352 KB Output is correct
38 Correct 10 ms 2352 KB Output is correct
39 Correct 12 ms 2352 KB Output is correct
40 Correct 14 ms 2352 KB Output is correct