oj.uz

Submission #557287

# Submission time Handle Problem Language Result Execution time Memory
557287 2022-05-05T05:26:13 Z pokmui9909 Nekameleoni (COCI15_nekameleoni) C++17
42 / 140
 3000 ms 174156 KB 
#include <bits/stdc++.h>
#include <ctime>
using namespace std;
using ll = long long;
 
int N, K, Q;
const int INF = 1e9;
struct Node{
    int ans;
    int L[55] = {}, R[55] = {};
    Node(){}
    Node(int _ans){ans = _ans; for(ll i = 0; i < 55; i++) L[i] = INF, R[i] = -INF;}
};
Node f(Node &p, Node &q){
    Node ret(min(p.ans, q.ans));
    for(int i = 1; i <= K; i++){
        ret.L[i] = min(p.L[i], q.L[i]);
        ret.R[i] = max(p.R[i], q.R[i]);
    }
    vector<pair<int, int>> V;
    for(int i = 1; i <= K; i++){
        V.push_back({p.R[i], i});
    }   
    sort(V.begin(), V.end());
    int r = -1;
    for(int i = 0; i + 1 < K; i++){
        if(q.L[V[i].second] == -INF) break;
        r = max(r, q.L[V[i].second]);
        ret.ans = min(ret.ans, r - V[i + 1].first + 1);
    }
    return ret;
}
Node T[400005];
void update(int n, int s, int e, int k, int v){
    if(s == e){
        T[n] = Node(K == 1 ? 1 : INF);
        T[n].L[v] = T[n].R[v] = k;  
        return;
    }
    int m = (s + e) / 2;
    if(k <= m) update(n * 2, s, m, k, v);
    else update(n * 2 + 1, m + 1, e, k, v);
    T[n] = f(T[n * 2], T[n * 2 + 1]);
}
 
int main(){
    cin.tie(0) -> sync_with_stdio(false);
    
    fill(T, T + 400005, Node(K == 1 ? 1 : INF));
    cin >> N >> K >> Q;
    for(int i = 1; i <= N; i++){
        int v; cin >> v;
        update(1, 1, N, i, v);
    }
    while(Q--){
        int op; cin >> op;
        if(op == 1){
            int k, v; cin >> k >> v;
            update(1, 1, N, k, v);
        } else {
            cout << (T[1].ans > N ? -1 : T[1].ans) << '\n';
        }
    }
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 174028 KB Output is correct
2 Correct 138 ms 174076 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 174028 KB Output is correct
2 Correct 206 ms 173980 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 174088 KB Output is correct
2 Correct 327 ms 174088 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1509 ms 174128 KB Output is correct
2 Execution timed out 3103 ms 174068 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2869 ms 174128 KB Output is correct
2 Execution timed out 3093 ms 174088 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2960 ms 174088 KB Output is correct
2 Execution timed out 3101 ms 174096 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3103 ms 174120 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3090 ms 174156 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3105 ms 174088 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3101 ms 174076 KB Time limit exceeded
2 Halted 0 ms 0 KB -