oj.uz

Submission #404282

# Submission time Handle Problem Language Result Execution time Memory
404282 2021-05-14T04:57:38 Z AriaH Examination (JOI19_examination) C++11
100 / 100
 718 ms 93228 KB 
/** I can do this all day **/

#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;

typedef long long                   ll;
typedef long double                 ld;
typedef pair<int,int>               pii;
typedef pair<ll,ll>                 pll;
#define all(x)                      (x).begin(),(x).end()
#define F                           first
#define S                           second
#define Mp                          make_pair
#define SZ(x)			    		(int)x.size()
#define fast_io                     ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io                     freopen("in.txt" , "r+" , stdin) ; freopen("out.txt" , "w+" , stdout);

const int N = 1e5 + 10;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ll inf = 8e18;
const int LOG = 18;

ll pw(ll a , ll b, ll M)  { return (!b ? 1 : (b & 1 ? (a * pw(a * a % M, b / 2, M)) % M : pw(a * a % M, b / 2, M))); }

int n;

struct segment
{
	int A[N];
	vector < int > seg[N << 2], I[N << 2];
	void Set(int id, int x)
	{
		A[id] = x;
	}
	void Merge(int v)
	{
		int i = 0, j = 0, n1 = SZ(seg[v << 1]), m = SZ(seg[v << 1 | 1]);
		I[v].push_back(0);
		while(i < n1 || j < m)
		{
			if(i < n1 && (j == m || seg[v << 1][i] < seg[v << 1 | 1][j]))
			{
				seg[v].push_back(seg[v << 1][i ++]);
				I[v].push_back(I[v].back() + 1);
			}
			else
			{
				seg[v].push_back(seg[v << 1 | 1][j ++]);
				I[v].push_back(I[v].back());
			}
		}
	}
	void build(int v = 1, int tl = 1, int tr = n)
	{
		if(tl == tr)
		{
			seg[v].push_back(A[tl]);
			return;
		}
		int mid = (tl + tr) >> 1;
		build(v << 1, tl, mid);
		build(v << 1 | 1, mid + 1, tr);
		Merge(v);
	}
	int G(int l, int r, int id, int v = 1, int tl = 1, int tr = n)
	{
		if(l > tr || r < tl || l > r) return 0;
		if(l <= tl && tr <= r)
		{
			return id;
		}
		int mid = (tl + tr) >> 1;
		return G(l, r, I[v][id], v << 1, tl, mid) + G(l, r, id - I[v][id], v << 1 | 1, mid + 1, tr);
	}
	int get(int l, int r, int x) /// tedad adad l, r, ke A[i] < x
	{
		int id = lower_bound(all(seg[1]), x) - seg[1].begin();
		return G(l, r, id);
	}
};

int q, ord[N], S[N], T[N], A[N], B[N], C[N];

bool cmp(int i, int j)
{
	return S[i] + T[i] < S[j] + T[j];
}

int main()
{
	scanf("%d%d", &n, &q);
	for(int i = 1; i <= n; i ++)
	{
		scanf("%d%d", &S[i], &T[i]);
		ord[i] = i;
	}
	for(int i = 1; i <= q; i ++)
	{
		scanf("%d%d%d", &A[i], &B[i], &C[i]);
		C[i] = max(C[i], A[i] + B[i]);
	}
	sort(ord + 1, ord + n + 1, cmp);
	segment segS, segT;
	vector < int > vec;
	for(int i = 1; i <= n; i ++)
	{
		///printf("i = %d ord = %d fir = %d sec = %d\n", i, ord[i], S[ord[i]], T[ord[i]]);
		segS.Set(i, S[ord[i]]);
		segT.Set(i, T[ord[i]]);
		vec.push_back(S[ord[i]] + T[ord[i]]);
	}
	segS.build();
	segT.build();
	for(int i = 1; i <= q; i ++)
	{
		int id = lower_bound(all(vec), C[i]) - vec.begin() + 1;
		///printf("i = %d id = %d A : %d B : %d\n", i, id, segS.get(id, n, A[i]), segT.get(id, n, B[i]));
		printf("%d\n", n - id + 1 - segS.get(id, n, A[i]) - segT.get(id, n, B[i]));
	}
    return 0;
}

/** test corner cases(n = 1?) watch for overflow or minus indices **/

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:93:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |  scanf("%d%d", &n, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~
examination.cpp:96:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |   scanf("%d%d", &S[i], &T[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
examination.cpp:101:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |   scanf("%d%d%d", &A[i], &B[i], &C[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 38656 KB Output is correct
2 Correct 31 ms 38604 KB Output is correct
3 Correct 30 ms 38640 KB Output is correct
4 Correct 33 ms 38664 KB Output is correct
5 Correct 29 ms 38580 KB Output is correct
6 Correct 32 ms 38564 KB Output is correct
7 Correct 41 ms 39892 KB Output is correct
8 Correct 43 ms 39804 KB Output is correct
9 Correct 38 ms 39884 KB Output is correct
10 Correct 38 ms 39856 KB Output is correct
11 Correct 37 ms 39916 KB Output is correct
12 Correct 34 ms 39884 KB Output is correct
13 Correct 51 ms 39832 KB Output is correct
14 Correct 37 ms 39824 KB Output is correct
15 Correct 42 ms 39852 KB Output is correct
16 Correct 36 ms 39856 KB Output is correct
17 Correct 36 ms 39848 KB Output is correct
18 Correct 37 ms 39884 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 702 ms 90300 KB Output is correct
2 Correct 690 ms 90680 KB Output is correct
3 Correct 653 ms 90676 KB Output is correct
4 Correct 634 ms 89928 KB Output is correct
5 Correct 614 ms 89964 KB Output is correct
6 Correct 409 ms 89248 KB Output is correct
7 Correct 493 ms 90652 KB Output is correct
8 Correct 496 ms 90548 KB Output is correct
9 Correct 384 ms 90632 KB Output is correct
10 Correct 549 ms 89756 KB Output is correct
11 Correct 598 ms 89776 KB Output is correct
12 Correct 255 ms 88780 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 702 ms 90300 KB Output is correct
2 Correct 690 ms 90680 KB Output is correct
3 Correct 653 ms 90676 KB Output is correct
4 Correct 634 ms 89928 KB Output is correct
5 Correct 614 ms 89964 KB Output is correct
6 Correct 409 ms 89248 KB Output is correct
7 Correct 493 ms 90652 KB Output is correct
8 Correct 496 ms 90548 KB Output is correct
9 Correct 384 ms 90632 KB Output is correct
10 Correct 549 ms 89756 KB Output is correct
11 Correct 598 ms 89776 KB Output is correct
12 Correct 255 ms 88780 KB Output is correct
13 Correct 631 ms 91108 KB Output is correct
14 Correct 672 ms 91032 KB Output is correct
15 Correct 665 ms 90700 KB Output is correct
16 Correct 558 ms 90296 KB Output is correct
17 Correct 555 ms 90328 KB Output is correct
18 Correct 348 ms 89276 KB Output is correct
19 Correct 616 ms 91096 KB Output is correct
20 Correct 663 ms 91020 KB Output is correct
21 Correct 596 ms 91016 KB Output is correct
22 Correct 555 ms 89836 KB Output is correct
23 Correct 542 ms 89684 KB Output is correct
24 Correct 266 ms 88840 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 38656 KB Output is correct
2 Correct 31 ms 38604 KB Output is correct
3 Correct 30 ms 38640 KB Output is correct
4 Correct 33 ms 38664 KB Output is correct
5 Correct 29 ms 38580 KB Output is correct
6 Correct 32 ms 38564 KB Output is correct
7 Correct 41 ms 39892 KB Output is correct
8 Correct 43 ms 39804 KB Output is correct
9 Correct 38 ms 39884 KB Output is correct
10 Correct 38 ms 39856 KB Output is correct
11 Correct 37 ms 39916 KB Output is correct
12 Correct 34 ms 39884 KB Output is correct
13 Correct 51 ms 39832 KB Output is correct
14 Correct 37 ms 39824 KB Output is correct
15 Correct 42 ms 39852 KB Output is correct
16 Correct 36 ms 39856 KB Output is correct
17 Correct 36 ms 39848 KB Output is correct
18 Correct 37 ms 39884 KB Output is correct
19 Correct 702 ms 90300 KB Output is correct
20 Correct 690 ms 90680 KB Output is correct
21 Correct 653 ms 90676 KB Output is correct
22 Correct 634 ms 89928 KB Output is correct
23 Correct 614 ms 89964 KB Output is correct
24 Correct 409 ms 89248 KB Output is correct
25 Correct 493 ms 90652 KB Output is correct
26 Correct 496 ms 90548 KB Output is correct
27 Correct 384 ms 90632 KB Output is correct
28 Correct 549 ms 89756 KB Output is correct
29 Correct 598 ms 89776 KB Output is correct
30 Correct 255 ms 88780 KB Output is correct
31 Correct 631 ms 91108 KB Output is correct
32 Correct 672 ms 91032 KB Output is correct
33 Correct 665 ms 90700 KB Output is correct
34 Correct 558 ms 90296 KB Output is correct
35 Correct 555 ms 90328 KB Output is correct
36 Correct 348 ms 89276 KB Output is correct
37 Correct 616 ms 91096 KB Output is correct
38 Correct 663 ms 91020 KB Output is correct
39 Correct 596 ms 91016 KB Output is correct
40 Correct 555 ms 89836 KB Output is correct
41 Correct 542 ms 89684 KB Output is correct
42 Correct 266 ms 88840 KB Output is correct
43 Correct 634 ms 93228 KB Output is correct
44 Correct 615 ms 93016 KB Output is correct
45 Correct 718 ms 93060 KB Output is correct
46 Correct 527 ms 91564 KB Output is correct
47 Correct 532 ms 91612 KB Output is correct
48 Correct 296 ms 89100 KB Output is correct
49 Correct 524 ms 93072 KB Output is correct
50 Correct 546 ms 92984 KB Output is correct
51 Correct 455 ms 92928 KB Output is correct
52 Correct 497 ms 91320 KB Output is correct
53 Correct 594 ms 90504 KB Output is correct