oj.uz

답안 #57749

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
57749 2018-07-16T01:39:02 Z Benq Poklon (COCI17_poklon) C++14
56 / 140
 5000 ms 37468 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 500001;

int N,Q, A[MX], ans[MX], oc[MX];
vector<array<int,3>> todo;
map<int,int> m;

bool cmp(array<int,3> a, array<int,3> b) {
    if (a[0]/sqrt(N) != b[0]/sqrt(N)) return a[0] < b[0];
    return a[1] < b[1];
}

int l = 0, r = -1, cans = 0;

void ad(int x, int y = 1) {
    x = A[x];
    if (oc[x] == 2) cans --;
    oc[x] += y;
    if (oc[x] == 2) cans ++;
}

int answer(int L, int R) {
    while (l > L) ad(--l);
    while (r < R) ad(++r);
    while (l < L) ad(l++,-1);
    while (r > R) ad(r--,-1);
    return cans;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> Q;
    int co = 0;
    F0R(i,N) {
        cin >> A[i];
        if (!m.count(A[i])) m[A[i]] = co++;
        A[i] = m[A[i]];
    }
    F0R(i,Q) {
        int a,b; cin >> a >> b;
        todo.pb({a-1,b-1,i});
    }
    sort(all(todo),cmp);
    for (auto a: todo) ans[a[2]] = answer(a[0],a[1]);
    F0R(i,Q) cout << ans[i] << "\n";
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
56.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 5 ms 536 KB Output is correct
4 Correct 29 ms 864 KB Output is correct
5 Execution timed out 5004 ms 4208 KB Time limit exceeded
6 Execution timed out 5013 ms 5736 KB Time limit exceeded
7 Execution timed out 5015 ms 10892 KB Time limit exceeded
8 Execution timed out 5101 ms 19288 KB Time limit exceeded
9 Execution timed out 5013 ms 26840 KB Time limit exceeded
10 Execution timed out 5025 ms 37468 KB Time limit exceeded