oj.uz

답안 #921613

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921613 2024-02-04T08:08:12 Z ByeWorld 말 (IOI15_horses) C++14
100 / 100
 464 ms 68180 KB 
#include "horses.h"
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
const int MAXN = 5e5+10;
const int MOD = 1e9+7;
const int INF = 1e9;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;

ll mul(ll x, ll y){
	ll num = (x*y)%MOD;
	return num;
}

int n;
ll x[MAXN], y[MAXN], mx, idx;
set <int> S;

struct seg {
	ll st[4*MAXN]; 
	void bd(int id, int l, int r){
		if(l==r){
            st[id] = x[l];
            return;
        }
		bd(lf, l, md); bd(rg, md+1, r);
        st[id] = mul(st[lf], st[rg]);
	}
	ll que(int id, int l, int r, int x, int y){
		if(x<=l && r<=y) return st[id];
		if(r<x || y<l) return 1;
		return mul(que(lf, l, md, x, y), que(rg, md+1, r, x, y));
	}
	ll upd(int id, int l, int r, int x, ll p){
		if(l==r && x==l){
			return st[id] = p;
		}
		if(r<x || x<l) return st[id];
		return st[id] = mul(upd(lf, l, md, x, p), 
            upd(rg, md+1, r, x, p));
	}
} A;
struct segtree {
	ll st[4*MAXN]; // pr[i] * y[i]
	void bd(int id, int l, int r){
		if(l==r){
            st[id] = y[l]; return;
        }
		bd(lf, l, md); bd(rg, md+1, r);
        st[id] = max(st[lf], st[rg]);
	}
	ll que(int id, int l, int r, int x, int y){
		if(x<=l && r<=y) return st[id];
		if(r<x || y<l) return -INF;
		return max(que(lf, l, md, x, y), que(rg, md+1, r, x, y));
	}
	ll upd(int id, int l, int r, int x, ll p){
		if(l==r && l==x){
			return st[id] = p;
		}
		if(r<x || x<l) return st[id];
		return st[id] = max(upd(lf, l, md, x, p), 
            upd(rg, md+1, r, x, p));
	}
} B;

vector <pii> cand;
int calc(){
    cand.clear();
	auto it = S.end();
    int L = -1, R = n; 
    ll mY = -1;
    for (int i=0;i<30;i++) {
        --it;
        L = *it;
        mY = B.que(1, 1, n, L, R);
        cand.pb(pii(mY, L));
        R = L-1;
        if (R == 0) { // udh keluar
            break;
        }
    }
    
    ll opt = 0, prod=1;
    for (int i=0;i<cand.size();i++) {
        if (cand[opt].fi*prod < cand[i].fi) {
            opt = i;
            prod = 1;
        }
        prod *= x[cand[i].se];
        if (prod > INF) {
            break;
        }
    }
    ll ans = mul(A.que(1, 1, n, 1, cand[opt].se), 
        cand[opt].fi);
    return (int)(ans);
}

int init(int N, int X[], int Y[]) {
	n = N;
    S.insert(1);
	for(int i=1; i<=n; i++) {
		x[i] = X[i-1]; y[i] = Y[i-1];
        if(x[i] != 1) S.insert(i);
	}
    A.bd(1, 1, n);
    B.bd(1, 1, n);
    
	return calc();
}

int updateX(int pos, int val) {	
    pos++;
    if(x[pos] != 1 && val == 1) S.erase(pos); 
    if(x[pos] == 1 && val != 1) S.insert(pos);
    S.insert(1);
    
	x[pos] = val; 
    // upd segtree X
    A.upd(1, 1, n, pos, val);
    
	return calc();
}

int updateY(int pos, int val) {
    pos++;
	y[pos] = val; 
    // upd segtree Y
    B.upd(1, 1, n, pos, val);
    
	return calc();
}

Compilation message

horses.cpp: In member function 'long long int seg::que(int, int, int, int, int)':
horses.cpp:37:42: warning: declaration of 'y' shadows a global declaration [-Wshadow]
   37 |  ll que(int id, int l, int r, int x, int y){
      |                                      ~~~~^
horses.cpp:24:13: note: shadowed declaration is here
   24 | ll x[MAXN], y[MAXN], mx, idx;
      |             ^
horses.cpp:37:35: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   37 |  ll que(int id, int l, int r, int x, int y){
      |                               ~~~~^
horses.cpp:24:4: note: shadowed declaration is here
   24 | ll x[MAXN], y[MAXN], mx, idx;
      |    ^
horses.cpp: In member function 'long long int seg::upd(int, int, int, int, long long int)':
horses.cpp:42:35: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   42 |  ll upd(int id, int l, int r, int x, ll p){
      |                               ~~~~^
horses.cpp:24:4: note: shadowed declaration is here
   24 | ll x[MAXN], y[MAXN], mx, idx;
      |    ^
horses.cpp: In member function 'long long int segtree::que(int, int, int, int, int)':
horses.cpp:60:42: warning: declaration of 'y' shadows a global declaration [-Wshadow]
   60 |  ll que(int id, int l, int r, int x, int y){
      |                                      ~~~~^
horses.cpp:24:13: note: shadowed declaration is here
   24 | ll x[MAXN], y[MAXN], mx, idx;
      |             ^
horses.cpp:60:35: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   60 |  ll que(int id, int l, int r, int x, int y){
      |                               ~~~~^
horses.cpp:24:4: note: shadowed declaration is here
   24 | ll x[MAXN], y[MAXN], mx, idx;
      |    ^
horses.cpp: In member function 'long long int segtree::upd(int, int, int, int, long long int)':
horses.cpp:65:35: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   65 |  ll upd(int id, int l, int r, int x, ll p){
      |                               ~~~~^
horses.cpp:24:4: note: shadowed declaration is here
   24 | ll x[MAXN], y[MAXN], mx, idx;
      |    ^
horses.cpp: In function 'int calc()':
horses.cpp:93:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |     for (int i=0;i<cand.size();i++) {
      |                  ~^~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6744 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6576 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 5 ms 6492 KB Output is correct
24 Correct 4 ms 6580 KB Output is correct
25 Correct 3 ms 6492 KB Output is correct
26 Correct 3 ms 6492 KB Output is correct
27 Correct 3 ms 6492 KB Output is correct
28 Correct 3 ms 6652 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 3 ms 6680 KB Output is correct
31 Correct 3 ms 6492 KB Output is correct
32 Correct 3 ms 6640 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 437 ms 57100 KB Output is correct
2 Correct 446 ms 68176 KB Output is correct
3 Correct 411 ms 59216 KB Output is correct
4 Correct 437 ms 63068 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6900 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6540 KB Output is correct
23 Correct 3 ms 6488 KB Output is correct
24 Correct 3 ms 6492 KB Output is correct
25 Correct 3 ms 6492 KB Output is correct
26 Correct 3 ms 6492 KB Output is correct
27 Correct 3 ms 6492 KB Output is correct
28 Correct 3 ms 6488 KB Output is correct
29 Correct 2 ms 6488 KB Output is correct
30 Correct 3 ms 6492 KB Output is correct
31 Correct 4 ms 6492 KB Output is correct
32 Correct 3 ms 6492 KB Output is correct
33 Correct 66 ms 31312 KB Output is correct
34 Correct 58 ms 35464 KB Output is correct
35 Correct 197 ms 65892 KB Output is correct
36 Correct 167 ms 65564 KB Output is correct
37 Correct 76 ms 33328 KB Output is correct
38 Correct 108 ms 46096 KB Output is correct
39 Correct 32 ms 33068 KB Output is correct
40 Correct 172 ms 60588 KB Output is correct
41 Correct 38 ms 33268 KB Output is correct
42 Correct 48 ms 33364 KB Output is correct
43 Correct 133 ms 61412 KB Output is correct
44 Correct 141 ms 60892 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6488 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6576 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6592 KB Output is correct
21 Correct 1 ms 6488 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 4 ms 6644 KB Output is correct
24 Correct 3 ms 6492 KB Output is correct
25 Correct 3 ms 6492 KB Output is correct
26 Correct 3 ms 6492 KB Output is correct
27 Correct 3 ms 6492 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 3 ms 6492 KB Output is correct
31 Correct 3 ms 6492 KB Output is correct
32 Correct 3 ms 6492 KB Output is correct
33 Correct 413 ms 57264 KB Output is correct
34 Correct 458 ms 68180 KB Output is correct
35 Correct 444 ms 59476 KB Output is correct
36 Correct 441 ms 63096 KB Output is correct
37 Correct 69 ms 35168 KB Output is correct
38 Correct 57 ms 35180 KB Output is correct
39 Correct 184 ms 65616 KB Output is correct
40 Correct 179 ms 65456 KB Output is correct
41 Correct 62 ms 33360 KB Output is correct
42 Correct 97 ms 46216 KB Output is correct
43 Correct 26 ms 33116 KB Output is correct
44 Correct 192 ms 60500 KB Output is correct
45 Correct 39 ms 33104 KB Output is correct
46 Correct 55 ms 33348 KB Output is correct
47 Correct 133 ms 61012 KB Output is correct
48 Correct 142 ms 60988 KB Output is correct
49 Correct 412 ms 38252 KB Output is correct
50 Correct 343 ms 38152 KB Output is correct
51 Correct 456 ms 67520 KB Output is correct
52 Correct 427 ms 66776 KB Output is correct
53 Correct 459 ms 36476 KB Output is correct
54 Correct 405 ms 49936 KB Output is correct
55 Correct 99 ms 34320 KB Output is correct
56 Correct 464 ms 62244 KB Output is correct
57 Correct 223 ms 34896 KB Output is correct
58 Correct 335 ms 35336 KB Output is correct
59 Correct 136 ms 61008 KB Output is correct