oj.uz

답안 #62726

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
62726 2018-07-29T22:18:10 Z qkxwsm Worst Reporter 3 (JOI18_worst_reporter3) C++11
19 / 100
 1237 ms 263168 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 arr[MAXN];
ll per[MAXN], dis[MAXN];

ll getpos(int idx, ll t)
{
    return dis[idx] * (t / per[idx]) - idx;
}
int solve(ll t, ll pos)
{
    //how many guys have position >= pos?
    if (getpos(0, t) < pos)
    {
        return 0;
    }
    int lo = 0, 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);
    arr[0] = 1;
    per[0] = 1; dis[0] = 1;
    for (int i = 1; i <= N; i++)
    {
        readi(arr[i]);
    }
    for (int i = 1; i <= N; i++)
    {
        ll frq = (arr[i] + 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);
        cout << solve(t, lt) - solve(t, rt + 1) << '\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:182: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:183: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

# 결과 실행 시간 메모리 Grader output
1 Correct 1208 ms 15264 KB Output is correct
2 Correct 1097 ms 15384 KB Output is correct
3 Correct 1025 ms 30932 KB Output is correct
4 Correct 1136 ms 46448 KB Output is correct
5 Correct 1104 ms 61928 KB Output is correct
6 Correct 1237 ms 77220 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 77220 KB Output is correct
2 Correct 4 ms 77220 KB Output is correct
3 Correct 2 ms 77220 KB Output is correct
4 Correct 4 ms 77220 KB Output is correct
5 Correct 3 ms 77220 KB Output is correct
6 Correct 3 ms 77220 KB Output is correct

Subtask #3
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1208 ms 15264 KB Output is correct
2 Correct 1097 ms 15384 KB Output is correct
3 Correct 1025 ms 30932 KB Output is correct
4 Correct 1136 ms 46448 KB Output is correct
5 Correct 1104 ms 61928 KB Output is correct
6 Correct 1237 ms 77220 KB Output is correct
7 Correct 3 ms 77220 KB Output is correct
8 Correct 4 ms 77220 KB Output is correct
9 Correct 2 ms 77220 KB Output is correct
10 Correct 4 ms 77220 KB Output is correct
11 Correct 3 ms 77220 KB Output is correct
12 Correct 3 ms 77220 KB Output is correct
13 Correct 469 ms 91296 KB Output is correct
14 Correct 502 ms 108184 KB Output is correct
15 Correct 468 ms 123124 KB Output is correct
16 Correct 546 ms 138836 KB Output is correct
17 Correct 758 ms 158456 KB Output is correct
18 Correct 816 ms 175292 KB Output is correct
19 Correct 798 ms 191924 KB Output is correct
20 Correct 761 ms 208340 KB Output is correct
21 Correct 828 ms 224068 KB Output is correct
22 Correct 821 ms 239468 KB Output is correct
23 Correct 922 ms 254388 KB Output is correct
24 Runtime error 812 ms 263168 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
25 Halted 0 ms 0 KB -