oj.uz

Submission #317581

# Submission time Handle Problem Language Result Execution time Memory
317581 2020-10-30T02:59:08 Z hoangtung_pro Fortune Telling 2 (JOI14_fortune_telling2) C++14
100 / 100
 467 ms 9812 KB 
#include<bits/stdc++.h>

#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define bit(s, i) (s & (1<<i))

using namespace std;

const int N = 2e5 + 5;
const int M = 1;
const int K = 1;
const int mod = 1e9+7;
const int inf = 2e9;
const long long Inf = 2e18;

typedef long long ll;
typedef pair < int, int > ii;

int n, k, a[N], b[N], c[N], poss[N], final[N];
vector < int > val;
vector < ii > reqry;
/// IT

int IT[4 * N];
void update(int id, int l, int r, int pos, int x) {
	if(l > pos || r < pos) return;

	if(l == r) {
		IT[id] = max(IT[id], x);
		return;
	}

	int mid = (l + r) >> 1;
	update(id<<1, l, mid, pos, x);
	update(id<<1|1, mid + 1, r, pos, x);

	IT[id] = max(IT[id<<1], IT[id<<1|1]);
}

int query(int id, int l, int r, int u, int v) {
	if(l > v || r <  u) return 0;
	
	if(u <= l && r <= v) return IT[id];

	int mid = (l + r) >> 1;

	return max(query(id<<1, l, mid, u, v), query(id<<1|1, mid + 1, r, u, v)); 
}

/// BIT 
int BIT[N];

void up(int id) {
	id = lower_bound(val.begin(), val.end(), id) - val.begin() + 1;
	for(; id; id -= id&-id) BIT[id] ++;
}

int get(int id) {
	id = lower_bound(val.begin(), val.end(), id) - val.begin() + 1;
	int tmp = 0;
	for(; id <= k; id += id&-id) tmp += BIT[id];
	return tmp;
}

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    if(fopen("trash.inp", "r")) {    
	    freopen("trash.inp","r",stdin);
	    freopen("trash.out","w",stdout);
    }
    cin >> n >> k;
    for(int i=1;i<=n;++i) cin >> a[i] >> b[i];
    for(int i=1;i<=k;++i) {
    	cin >> c[i];
    	val.pb(c[i]);
	}
	sort(val.begin(), val.end());

	for(int i=1;i<=k;++i) {
		int cur = lower_bound(val.begin(), val.end(), c[i]) - val.begin() + 1;
		update(1, 1, k, cur, i);
	}

	for(int i=1;i<=n;++i) {
		int mi = min(a[i], b[i]);
		int ma = max(a[i], b[i]);
		int L = lower_bound(val.begin(), val.end(), mi) - val.begin() + 1;
		int R = lower_bound(val.begin(), val.end(), ma) - val.begin();

		int cur = query(1, 1, k, L, R);
		poss[i] = cur;
		reqry.pb({cur, i});
	}

	sort(reqry.begin(), reqry.end());
	int run = 1;

	for(ii i : reqry) { 
		while(run <= i.fi) up(c[run ++ ]);
		int ma = max(a[i.se], b[i.se]);
		int ans = get(ma);
		int res = k - (lower_bound(val.begin(), val.end(), ma) - val.begin());
		final[i.se] = res - ans;
		// cout << i.se << ' ' << res << ' ' << ans << endl;
	}

	ll kqua = 0;

	for(int i=1;i<=n;++i) {
		if(!poss[i]) {
			if(final[i]&1) kqua += b[i];
			else kqua += a[i];
		}
		else {
			int cur = (a[i] < b[i]) ^ (final[i]&1);
			if(cur) kqua += b[i];
			else kqua += a[i];
		}
	}
	cout << kqua;
}

Compilation message

fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:71:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   71 |      freopen("trash.inp","r",stdin);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:72:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   72 |      freopen("trash.out","w",stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 17 ms 1024 KB Output is correct
15 Correct 35 ms 1524 KB Output is correct
16 Correct 54 ms 1908 KB Output is correct
17 Correct 75 ms 2416 KB Output is correct
18 Correct 75 ms 2416 KB Output is correct
19 Correct 74 ms 2420 KB Output is correct
20 Correct 74 ms 2416 KB Output is correct
21 Correct 72 ms 2416 KB Output is correct
22 Correct 56 ms 2416 KB Output is correct
23 Correct 57 ms 2416 KB Output is correct
24 Correct 57 ms 2416 KB Output is correct
25 Correct 54 ms 2416 KB Output is correct
26 Correct 57 ms 2292 KB Output is correct
27 Correct 64 ms 2420 KB Output is correct
28 Correct 63 ms 2416 KB Output is correct
29 Correct 66 ms 2492 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 17 ms 1024 KB Output is correct
15 Correct 35 ms 1524 KB Output is correct
16 Correct 54 ms 1908 KB Output is correct
17 Correct 75 ms 2416 KB Output is correct
18 Correct 75 ms 2416 KB Output is correct
19 Correct 74 ms 2420 KB Output is correct
20 Correct 74 ms 2416 KB Output is correct
21 Correct 72 ms 2416 KB Output is correct
22 Correct 56 ms 2416 KB Output is correct
23 Correct 57 ms 2416 KB Output is correct
24 Correct 57 ms 2416 KB Output is correct
25 Correct 54 ms 2416 KB Output is correct
26 Correct 57 ms 2292 KB Output is correct
27 Correct 64 ms 2420 KB Output is correct
28 Correct 63 ms 2416 KB Output is correct
29 Correct 66 ms 2492 KB Output is correct
30 Correct 192 ms 5104 KB Output is correct
31 Correct 241 ms 6512 KB Output is correct
32 Correct 323 ms 7404 KB Output is correct
33 Correct 461 ms 9580 KB Output is correct
34 Correct 172 ms 4848 KB Output is correct
35 Correct 467 ms 9580 KB Output is correct
36 Correct 462 ms 9708 KB Output is correct
37 Correct 459 ms 9720 KB Output is correct
38 Correct 461 ms 9628 KB Output is correct
39 Correct 462 ms 9580 KB Output is correct
40 Correct 402 ms 9572 KB Output is correct
41 Correct 453 ms 9812 KB Output is correct
42 Correct 447 ms 9708 KB Output is correct
43 Correct 296 ms 9576 KB Output is correct
44 Correct 298 ms 9548 KB Output is correct
45 Correct 301 ms 9576 KB Output is correct
46 Correct 353 ms 9708 KB Output is correct
47 Correct 328 ms 9572 KB Output is correct
48 Correct 365 ms 9452 KB Output is correct
49 Correct 354 ms 9192 KB Output is correct