oj.uz

답안 #205855

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
205855 2020-03-01T07:35:28 Z cheetose Worst Reporter 3 (JOI18_worst_reporter3) C++11
100 / 100
 526 ms 22828 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<ld> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 42043;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

map<ll,Pi> M;
ll d[500005];
int main() {
	int n,q;
	scanf("%d%d",&n,&q);
	d[0]=1;
	fup(i,1,n,1)
	{
		ll x;
		scanf("%lld",&x);
		ll t=x/d[i-1]*d[i-1];
		if(t<x)t+=d[i-1];
		d[i]=t;
	}
	int L=0;
	fup(R,1,n,1)
	{
		if(d[R]!=d[L])
		{
			M[d[L]]=mp(L,R-1);
			L=R;
		}
	}
	M[d[L]]=mp(L,n);
	while(q--)
	{
		ll t,l,r;
		scanf("%lld%lld%lld",&t,&l,&r);
		ll ans=0;
		for(auto it=M.begin();it!=M.end();it++)
		{
			ll D=it->X;
			Pi p=it->Y;
			ll L=D*(t/D)-p.Y,R=D*(t/D)-p.X;
			R=min(r,R),L=max(l,L);
			if(L<=R)ans+=R-L+1;
		}
		printf("%lld\n",ans);
	}
}

Compilation message

worst_reporter3.cpp: In function 'int main()':
worst_reporter3.cpp:48:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&q);
  ~~~~~^~~~~~~~~~~~~~
worst_reporter3.cpp:53:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&x);
   ~~~~~^~~~~~~~~~~
worst_reporter3.cpp:71:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld",&t,&l,&r);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 381 ms 21752 KB Output is correct
2 Correct 420 ms 22776 KB Output is correct
3 Correct 386 ms 22684 KB Output is correct
4 Correct 382 ms 22828 KB Output is correct
5 Correct 387 ms 22656 KB Output is correct
6 Correct 395 ms 22776 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
81.0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 381 ms 21752 KB Output is correct
2 Correct 420 ms 22776 KB Output is correct
3 Correct 386 ms 22684 KB Output is correct
4 Correct 382 ms 22828 KB Output is correct
5 Correct 387 ms 22656 KB Output is correct
6 Correct 395 ms 22776 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 411 ms 21240 KB Output is correct
14 Correct 406 ms 21880 KB Output is correct
15 Correct 389 ms 20472 KB Output is correct
16 Correct 396 ms 20984 KB Output is correct
17 Correct 492 ms 8952 KB Output is correct
18 Correct 490 ms 8696 KB Output is correct
19 Correct 500 ms 8696 KB Output is correct
20 Correct 493 ms 8824 KB Output is correct
21 Correct 485 ms 8824 KB Output is correct
22 Correct 495 ms 8812 KB Output is correct
23 Correct 493 ms 8952 KB Output is correct
24 Correct 487 ms 8832 KB Output is correct
25 Correct 400 ms 22708 KB Output is correct
26 Correct 391 ms 22776 KB Output is correct
27 Correct 503 ms 21648 KB Output is correct
28 Correct 526 ms 11736 KB Output is correct
29 Correct 520 ms 21880 KB Output is correct
30 Correct 517 ms 21840 KB Output is correct
31 Correct 522 ms 14732 KB Output is correct
32 Correct 375 ms 21368 KB Output is correct
33 Correct 5 ms 376 KB Output is correct