| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 560241 |
2022-05-11T07:54:02 Z |
Sam_a17 |
Poklon (COCI17_poklon) |
C++14 |
|
1754 ms |
18000 KB |
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) x.clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
#define pb push_back
#define pf push_front
#define popf pop_front
#define popb pop_back
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque<T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "" && str != "input") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
if(str == "input") {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 5e5 + 10;
int n, q, s, answer;
long long A[N], B[N];
struct node {
int l, r, id;
};
vector<node> queries;
bool cmp(node a, node b) {
if(a.l / s != b.l / s) {
return a.l / s < b.l / s;
}
return a.r > b.r;
}
void add(int index) {
B[A[index]]++;
if(B[A[index]] == 3) {
answer--;
}
if(B[A[index]] == 2) {
answer++;
}
}
void del(int index) {
B[A[index]]--;
if(B[A[index]] == 1) {
answer--;
}
if(B[A[index]] == 2) {
answer++;
}
}
void solve_() {
scanf("%d %d", &n, &q), s = sqrt(n);
vector<long long> a;
for(int i = 1; i <= n; i++) {
scanf("%lld", &A[i]);
a.push_back(A[i]);
}
sort(all(a)); uniq(a)
for(int i = 1; i <= n; i++) {
A[i] = lower_bound(all(a), A[i]) - a.begin() + 1;
}
for(int i = 1; i <= q; i++) {
int l, r; scanf("%d %d", &l, &r);
queries.push_back({l, r, i});
}
vector<int> answ(q + 1, 0);
sort(all(queries), cmp);
int l = 1, r = 1;
for(int i = 0; i < q; i++) {
int lx = queries[i].l, rx = queries[i].r + 1;
while(r < rx) {
add(r++);
}
while(l > lx) {
add(--l);
}
while(r > rx) {
del(--r);
}
while(l < lx) {
del(l++);
}
answ[queries[i].id] = answer;
}
for(int i = 1; i <= q; i++) {
printf("%d\n", answ[i]);
}
}
int main() {
setIO();
auto solve = [&](int test_case)-> void {
while(test_case--) {
solve_();
}
};
int test_cases = 1;
solve(test_cases);
return 0;
}
Compilation message
poklon.cpp: In function 'void setIO(std::string)':
poklon.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
66 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
poklon.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
67 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
poklon.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
71 | freopen("input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
poklon.cpp:72:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
72 | freopen("output.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
poklon.cpp: In function 'void solve_()':
poklon.cpp:117:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
117 | scanf("%d %d", &n, &q), s = sqrt(n);
| ~~~~~^~~~~~~~~~~~~~~~~
poklon.cpp:120:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
120 | scanf("%lld", &A[i]);
| ~~~~~^~~~~~~~~~~~~~~
poklon.cpp:131:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
131 | int l, r; scanf("%d %d", &l, &r);
| ~~~~~^~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
6 ms |
596 KB |
Output is correct |
| 5 |
Correct |
214 ms |
4148 KB |
Output is correct |
| 6 |
Correct |
187 ms |
4148 KB |
Output is correct |
| 7 |
Correct |
515 ms |
8064 KB |
Output is correct |
| 8 |
Correct |
934 ms |
14256 KB |
Output is correct |
| 9 |
Correct |
1289 ms |
15800 KB |
Output is correct |
| 10 |
Correct |
1754 ms |
18000 KB |
Output is correct |
