oj.uz

Submission #957044

# Submission time Handle Problem Language Result Execution time Memory
957044 2024-04-02T20:33:17 Z Mher777 Sequence (APIO23_sequence) C++17
0 / 100
 69 ms 15444 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
#include "sequence.h"
using namespace std;
mt19937 rnd(7069);
typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;
using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
const int MAX = int(2e9 + 5);
const ll MAXL = ll(1e18) + 5ll;

const int N = 500005;
int a[N], t[N];
pii id[N];
int n, m, ans = 1;

void add(int ind, int val) {
    while (ind <= n) {
        t[ind] += val;
        ind += (ind & -ind);
    }
}

int sum(int ind) {
    int ret = 0;
    while (ind) {
        ret += t[ind];
        ind -= (ind & -ind);
    }
    return ret;
}

int qry(int l, int r) {
    return abs(sum(r) - sum(l - 1));
}

int sequence(int N, std::vector<int> A) {
    n = N;
    for (int i = 1; i <= n; ++i) {
        a[i] = A[i - 1];
        if (!id[a[i]].ff) id[a[i]].ff = i;
        id[a[i]].ss = i;
        if (a[i] > 1) add(i, 1);
    }
    if (id[1].ff != 0 && id[1].ff != id[1].ss && qry(id[1].ff, id[1].ss) <= 2) return 2;
    for (int i = 2; i <= n; ++i) {
        if (id[i - 1].ff) add(id[i - 1].ff, -1);
        if (id[i - 1].ff && id[i - 1].ss != id[i - 1].ff) add(id[i - 1].ss, -1);
        int l = id[i].ff, r = id[i].ss;
        if (l) add(l, -1);
        if (l && l != r) add(r, -1);
        if (l && l != r && qry(l, r) <= 2) return 2;
    }
    return 1;
}

/*
14
2 6 2 5 3 4 2 1 4 3 5 6 3 2
*/

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Incorrect 1 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Incorrect 1 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Incorrect 45 ms 15440 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 15440 KB Output is correct
2 Correct 69 ms 15440 KB Output is correct
3 Incorrect 58 ms 15444 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Incorrect 1 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Incorrect 1 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -