oj.uz

Submission #685207

# Submission time Handle Problem Language Result Execution time Memory
685207 2023-01-23T17:05:24 Z Farhan_HY Grudanje (COCI19_grudanje) C++14
35 / 70
 2000 ms 111512 KB 
#include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

const int N = 1e5 + 5;
const int M = 1e3 + 3;
const int inf = 1e18;
const int mod = 1e9 + 7;
int n, q, a[N];
pair<int, int> p[N], tree[30][4 * N];
string s;

pair<int, int> getMax(pair<int, int> p1, pair<int, int> p2) {
    vector<int> v;
    v.push_back(p1.F);
    v.push_back(p1.S);
    v.push_back(p2.F);
    v.push_back(p2.S);
    sort(begin(v), end(v));
    return {v[3], v[2]};
}

void build(int letter, int node, int tl, int tr) {
    if (tr == tl) {
        if (s[tr] == (letter + 'a')) tree[letter][node] = {a[tl], 0};
        return;
    }
    int mid = (tl + tr) / 2;
    build(letter, 2 * node, tl, mid);
    build(letter, 2 * node + 1, mid + 1, tr);
    tree[letter][node] = getMax(tree[letter][2 * node], tree[letter][2 * node + 1]);
}

pair<int, int> get(int letter, int node, int tl, int tr, int l, int r) {
    if (tr < l || tl > r) return {0, 0};
    if (l <= tl && tr <= r) return tree[letter][node];
    int mid = (tl + tr) / 2;
    pair<int, int> p1 = get(letter, 2 * node, tl, mid, l, r);
    pair<int, int> p2 = get(letter, 2 * node + 1, mid + 1, tr, l, r);
    return getMax(p1, p2);
}

main() {
    IOS
    cin >> s;
    n = s.size();
    s = '.' + s;
    cin >> q;
    for(int i = 1; i <= q; i++) cin >> p[i].F >> p[i].S;
    sort(p, p + q + 1);
    for(int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        a[x] = i;
    }
    int mx = 0;
    for(int j = 0; j < 26; j++)
        build(j, 1, 1, n);
    for(int i = 1; i <= q; i++) {
        for(int j = 0; j < 26; j++) {
            int l = p[i].F, r = p[i].S;
            int need = get(j, 1, 1, n, l, r).S;
            mx = max(mx, need);
        }
    }
    cout << mx << '\n';
}

Compilation message

grudanje.cpp:47:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   47 | main() {
      | ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 852 KB Output is correct
2 Correct 19 ms 808 KB Output is correct
3 Correct 20 ms 784 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 972 KB Output is correct
2 Correct 25 ms 788 KB Output is correct
3 Correct 19 ms 724 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 3948 KB Output is correct
2 Correct 139 ms 2576 KB Output is correct
3 Correct 147 ms 2456 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 3940 KB Output is correct
2 Correct 145 ms 2576 KB Output is correct
3 Correct 151 ms 2404 KB Output is correct

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 3924 KB Output is correct
2 Correct 144 ms 2572 KB Output is correct
3 Correct 149 ms 2452 KB Output is correct

Subtask #6
0 / 7.0

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

Subtask #7
0 / 7.0

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

Subtask #8
0 / 7.0

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

Subtask #9
0 / 7.0

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

Subtask #10
0 / 7.0

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