oj.uz

답안 #1098045

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1098045 2024-10-09T00:15:42 Z azberjibiou 송신탑 (IOI22_towers) C++17
23 / 100
 4000 ms 2032 KB 
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define lb lower_bound
#define gibon ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
typedef long long ll;
using namespace std;
const int mxN=500005;
const int mxM=2200005;
const int mxK=61;
const int MOD=1e9+7;
const ll INF=1e18;
int N, Q;
int A[mxN];
int qry[mxN][3];
int F[mxN];
/*
void input(){
    cin >> N >> Q;
    A[0]=-1e9-10, A[1]=1e9+10;
    for(int i=2;i<=N+1;i++) cin >> A[i];
    A[N+2]=1e9+10, A[N+3]=-1e9-10;
    for(int i=1;i<=Q;i++){
        int l, r, d;
        cin >> l >> r >> d;
        qry[i][0]=l;
        qry[i][1]=r;
        qry[i][2]=d;
    }
}
*/
void make_F(){
    stack <int> stk;
    stk.push(1);
    for(int i=2;i<=N+1;i++){
        while(A[stk.top()]<A[i]) stk.pop();
        if(A[i]<A[i-1] || A[i]<A[i+1]) continue;
        int mini=1e9+10;
        for(int j=stk.top()+1;j<i;j++) mini=min(mini, A[j]);
        F[i]=A[i]-mini;
        stk.push(i);
    }
    while(stk.size()) stk.pop();

    stk.push(N+2);
    for(int i=N+1;i>=2;i--){
        while(A[stk.top()]<A[i]) stk.pop();
        if(A[i]<A[i-1] || A[i]<A[i+1]) continue;
        int mini=1e9+10;
        for(int j=i+1;j<stk.top();j++) mini=min(mini, A[j]);
        F[i]=min(F[i], A[i]-mini);
        stk.push(i);
    }
    while(stk.size()) stk.pop();

    stk.push(0);
    for(int i=2;i<=N+1;i++){
        while(A[stk.top()]>A[i]) stk.pop();
        if(A[i]>A[i-1] || A[i]>A[i+1]) continue;
        int maxi=-1e9-10;
        for(int j=stk.top()+1;j<i;j++) maxi=max(maxi, A[j]);
        F[i]=maxi-A[i];
        stk.push(i);
    }

    stk.push(N+3);
    for(int i=N+1;i>=2;i--){
        while(A[stk.top()]>A[i]) stk.pop();
        if(A[i]>A[i-1] || A[i]>A[i+1]) continue;
        int maxi=-1e9-10;
        for(int j=i+1;j<stk.top();j++) maxi=max(maxi, A[j]);
        F[i]=min(F[i], maxi-A[i]);
        F[i]*=-1;
        stk.push(i);
    }
    //for(int i=1;i<=N;i++) printf("F[%d]=%d\n", i, F[i+1]);
}
void init(int n, vector <int> v){
    N=n;
    A[0]=-1e9-10, A[1]=1e9+10;
    for(int i=2;i<=N+1;i++) A[i]=v[i-2];
    A[N+2]=1e9+10, A[N+3]=-1e9-10;
    make_F();
}
int max_towers(int l, int r, int d){
    l+=2, r+=2;
    int lp=N+3, lm=N+3, rp=0, rm=0, mcnt=0, pcnt=0;
    for(int i=l;i<=r;i++){
        if(F[i]>=d) pcnt++, rp=max(rp, i), lp=min(lp, i);
        if(F[i]<=-d) mcnt++, rm=max(rm, i), lm=min(lm, i);
    }
    if(rp!=0 && rp>=rm){
        bool ok=false;
        for(int i=rp+1;i<=r;i++) if(A[i]<=A[rp]-d) ok=true;
        if(ok) mcnt++;
    }
    if(lp!=N+3 && lp<=lm){
        bool ok=false;
        for(int i=l;i<lp;i++) if(A[i]<=A[lp]-d) ok=true;
        if(ok) mcnt++;
    }
    return (mcnt<=1 ? 1 : mcnt);
}
/*
int main()
{
    gibon
    input();
    make_F();
    for(int i=1;i<=Q;i++){
        printf("%d\n", max_towers(qry[i][0], qry[i][1], qry[i][2]));
    }
} 
*/

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1638 ms 1112 KB Output is correct
2 Execution timed out 4026 ms 1624 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 10 ms 1476 KB Output is correct
37 Correct 14 ms 1880 KB Output is correct
38 Correct 15 ms 2032 KB Output is correct
39 Correct 18 ms 1864 KB Output is correct
40 Correct 19 ms 1868 KB Output is correct
41 Correct 14 ms 1880 KB Output is correct
42 Correct 13 ms 1880 KB Output is correct
43 Correct 15 ms 1624 KB Output is correct
44 Correct 9 ms 1624 KB Output is correct
45 Correct 9 ms 1624 KB Output is correct
46 Correct 9 ms 1624 KB Output is correct
47 Correct 14 ms 1876 KB Output is correct
48 Correct 14 ms 1880 KB Output is correct
49 Correct 13 ms 1856 KB Output is correct
50 Correct 9 ms 1876 KB Output is correct
51 Correct 9 ms 1624 KB Output is correct
52 Correct 15 ms 2008 KB Output is correct
53 Correct 14 ms 1880 KB Output is correct
54 Correct 15 ms 1868 KB Output is correct
55 Correct 13 ms 1624 KB Output is correct
56 Correct 9 ms 1624 KB Output is correct
57 Correct 14 ms 1980 KB Output is correct
58 Correct 15 ms 1880 KB Output is correct
59 Correct 15 ms 1880 KB Output is correct
60 Correct 14 ms 1880 KB Output is correct
61 Correct 14 ms 1880 KB Output is correct
62 Correct 14 ms 1964 KB Output is correct
63 Correct 20 ms 1880 KB Output is correct
64 Correct 9 ms 1624 KB Output is correct
65 Correct 9 ms 1624 KB Output is correct
66 Correct 9 ms 1624 KB Output is correct
67 Correct 10 ms 1464 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4024 ms 1880 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2565 ms 600 KB Output is correct
2 Execution timed out 4094 ms 1880 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 10 ms 1476 KB Output is correct
37 Correct 14 ms 1880 KB Output is correct
38 Correct 15 ms 2032 KB Output is correct
39 Correct 18 ms 1864 KB Output is correct
40 Correct 19 ms 1868 KB Output is correct
41 Correct 14 ms 1880 KB Output is correct
42 Correct 13 ms 1880 KB Output is correct
43 Correct 15 ms 1624 KB Output is correct
44 Correct 9 ms 1624 KB Output is correct
45 Correct 9 ms 1624 KB Output is correct
46 Correct 9 ms 1624 KB Output is correct
47 Correct 14 ms 1876 KB Output is correct
48 Correct 14 ms 1880 KB Output is correct
49 Correct 13 ms 1856 KB Output is correct
50 Correct 9 ms 1876 KB Output is correct
51 Correct 9 ms 1624 KB Output is correct
52 Correct 15 ms 2008 KB Output is correct
53 Correct 14 ms 1880 KB Output is correct
54 Correct 15 ms 1868 KB Output is correct
55 Correct 13 ms 1624 KB Output is correct
56 Correct 9 ms 1624 KB Output is correct
57 Correct 14 ms 1980 KB Output is correct
58 Correct 15 ms 1880 KB Output is correct
59 Correct 15 ms 1880 KB Output is correct
60 Correct 14 ms 1880 KB Output is correct
61 Correct 14 ms 1880 KB Output is correct
62 Correct 14 ms 1964 KB Output is correct
63 Correct 20 ms 1880 KB Output is correct
64 Correct 9 ms 1624 KB Output is correct
65 Correct 9 ms 1624 KB Output is correct
66 Correct 9 ms 1624 KB Output is correct
67 Correct 10 ms 1464 KB Output is correct
68 Execution timed out 4024 ms 1880 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1638 ms 1112 KB Output is correct
2 Execution timed out 4026 ms 1624 KB Time limit exceeded
3 Halted 0 ms 0 KB -