oj.uz

Submission #62729

# Submission time Handle Problem Language Result Execution time Memory
62729 2018-07-29T22:25:15 Z qkxwsm Worst Reporter 3 (JOI18_worst_reporter3) C++11
100 / 100
 1565 ms 26752 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 500013

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, Q;
ll per[MAXN], dis[MAXN];

ll getpos(int idx, ll t)
{
    if (LLINF / dis[idx] < (t / per[idx])) return LLINF;
    return dis[idx] * (t / per[idx]) - idx;
}
int solve(ll t, ll pos)
{
    //how many guys have position >= pos?
    int lo = -1, hi = N;
    while(hi > lo)
    {
        int mid = (hi + lo + 1) / 2;
        if (getpos(mid, t) >= pos)
        {
            lo = mid;
        }
        else
        {
            hi = mid - 1;
        }
    }
    return lo + 1;
}

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);
	}
    readi(N); readi(Q);
    per[0] = 1; dis[0] = 1;
    for (int i = 1; i <= N; i++)
    {
        ll d;
        readi(d);
        ll frq = (d + dis[i - 1] - 1) / (dis[i - 1]);
        if (LLINF / frq < per[i - 1])
        {
            N = i - 1;
            break;
        }
        per[i] = per[i - 1] * frq;
        dis[i] = dis[i - 1] * frq;
        // cerr << "guy " << i << " moves " << dis[i] << " every " << per[i] << endl;
    }
    while(Q--)
    {
        ll t, lt, rt;
        readi(t); readi(lt); readi(rt);
        printi(solve(t, lt) - solve(t, rt + 1));
        putchar('\n');
    }
	//	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

Compilation message

worst_reporter3.cpp: In function 'int32_t main()':
worst_reporter3.cpp:178: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);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
worst_reporter3.cpp:179: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
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1565 ms 11092 KB Output is correct
2 Correct 1496 ms 11264 KB Output is correct
3 Correct 1330 ms 11308 KB Output is correct
4 Correct 1405 ms 11308 KB Output is correct
5 Correct 1549 ms 26572 KB Output is correct
6 Correct 1495 ms 26644 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26644 KB Output is correct
2 Correct 3 ms 26644 KB Output is correct
3 Correct 4 ms 26644 KB Output is correct
4 Correct 3 ms 26644 KB Output is correct
5 Correct 3 ms 26644 KB Output is correct
6 Correct 3 ms 26644 KB Output is correct

Subtask #3
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 1565 ms 11092 KB Output is correct
2 Correct 1496 ms 11264 KB Output is correct
3 Correct 1330 ms 11308 KB Output is correct
4 Correct 1405 ms 11308 KB Output is correct
5 Correct 1549 ms 26572 KB Output is correct
6 Correct 1495 ms 26644 KB Output is correct
7 Correct 5 ms 26644 KB Output is correct
8 Correct 3 ms 26644 KB Output is correct
9 Correct 4 ms 26644 KB Output is correct
10 Correct 3 ms 26644 KB Output is correct
11 Correct 3 ms 26644 KB Output is correct
12 Correct 3 ms 26644 KB Output is correct
13 Correct 753 ms 26644 KB Output is correct
14 Correct 672 ms 26644 KB Output is correct
15 Correct 763 ms 26644 KB Output is correct
16 Correct 754 ms 26644 KB Output is correct
17 Correct 849 ms 26644 KB Output is correct
18 Correct 945 ms 26644 KB Output is correct
19 Correct 968 ms 26644 KB Output is correct
20 Correct 914 ms 26644 KB Output is correct
21 Correct 909 ms 26644 KB Output is correct
22 Correct 898 ms 26644 KB Output is correct
23 Correct 889 ms 26644 KB Output is correct
24 Correct 940 ms 26644 KB Output is correct
25 Correct 1288 ms 26752 KB Output is correct
26 Correct 1389 ms 26752 KB Output is correct
27 Correct 1174 ms 26752 KB Output is correct
28 Correct 1085 ms 26752 KB Output is correct
29 Correct 938 ms 26752 KB Output is correct
30 Correct 1068 ms 26752 KB Output is correct
31 Correct 1143 ms 26752 KB Output is correct
32 Correct 1149 ms 26752 KB Output is correct
33 Correct 3 ms 26752 KB Output is correct