| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 848032 |
2023-09-11T06:14:52 Z |
nnhzzz |
Poklon (COCI17_poklon) |
C++14 |
|
257 ms |
39252 KB |
// cre: Nguyen Ngoc Hung - Train VOI 2024 :>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <unordered_set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <cstring>
#include <unordered_map>
#include <cmath>
#include <array>
#include <cassert>
#include <random>
using namespace std;
#define SORT_UNIQUE(v) sort(ALL(v)),(v).resize(unique(ALL(v))-(v).begin())
#define __nnhzzz__ signed main()
#define BIT(i,j) ((i>>j)&1LL)
#define MASK(i) (1LL<<i)
#define RALL(x) (x).rbegin(),(x).rend()
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) (int)(x).size()
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pii>
#define RESET(x,val) memset((x),(val),sizeof(x))
#define REPDIS(i,be,en,j) for(int i = (be); i<=(en); i+=j)
#define REPD(i,be,en) for(int i = (be); i>=(en); i--)
#define REP(i,be,en) for(int i = (be); i<=(en); i++)
//-------------------------------------------------------------//
const int oo = 1e9,LOG = 20,MAXN = 5e5+7,N = 1e2+3;
const int MOD = 1e9+7,MOD1 = 1e9+207,MOD2 = 1e9+407,MOD3 = 998244353;
//-------------------------------------------------------------//
template<typename T1, typename T2> bool mini(T1 &a, T2 b){if(a>b){a=b;return true;}return false;}
template<typename T1, typename T2> bool maxi(T1 &a, T2 b){if(a<b){a=b;return true;}return false;}
template<typename T> T gcd(T a, T b) { while(b) { a %= b; swap(a,b); } return a; }
template<typename T> T lcm(T a, T b) { return a/gcd(a,b)*b; }
/*
----------------------------------------------------------------
END OF TEMPLATE
----------------------------------------------------------------
Nguyen Ngoc Hung - nnhzzz
Training for VOI24 gold medal
----------------------------------------------------------------
*/
struct FENWICK_TREE{
vi f;
int n;
void update(int id, int val){
for(; id<=n; id+=id&-id){
f[id] += val;
}
}
int get(int id){
int res = 0;
for(; id>0; id-=id&-id){
res += f[id];
}
return res;
}
int get(int l, int r){
return get(r)-get(l-1);
}
FENWICK_TREE(int _):n(_){
f.resize(n+1);
}
};
int res[MAXN],lst[MAXN],a[MAXN];
vpii query[MAXN];
map<int,int> f;
void solve(){
int n,q; cin >> n >> q;
REP(i,1,n){
cin >> a[i];
}
REP(i,1,q){
int l,r; cin >> l >> r;
query[l].emplace_back(r,i);
}
FENWICK_TREE fen(n+3);
REPD(i,n,1){
int &nxt = f[a[i]];
if(nxt){
fen.update(nxt,1);
if(lst[nxt]) fen.update(lst[nxt],-2);
if(lst[lst[nxt]]) fen.update(lst[lst[nxt]],1);
}
lst[i] = nxt;
nxt = i;
for(auto [j,id]:query[i]){
res[id] = fen.get(j);
}
}
REP(i,1,q){
cout << res[i] << "\n";
}
}
__nnhzzz__{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#define name "test"
if(fopen(name".inp","r")){
freopen(name".inp","r",stdin);
freopen(name".out","w",stdout);
}
#define name1 "nnhzzz"
if(fopen(name1".inp","r")){
freopen(name1".inp","r",stdin);
freopen(name1".out","w",stdout);
}
int test = 1;
while(test--){
solve();
}
cerr << "\nTime elapsed: " << 1000*clock()/CLOCKS_PER_SEC << "ms\n";
return 0;
}
Compilation message
poklon.cpp: In function 'void solve()':
poklon.cpp:136:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
136 | for(auto [j,id]:query[i]){
| ^
poklon.cpp: In function 'int main()':
poklon.cpp:150:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
150 | freopen(name".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
poklon.cpp:151:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
151 | freopen(name".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
poklon.cpp:155:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
155 | freopen(name1".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
poklon.cpp:156:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
156 | freopen(name1".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
16984 KB |
Output is correct |
| 2 |
Correct |
3 ms |
16984 KB |
Output is correct |
| 3 |
Correct |
3 ms |
16984 KB |
Output is correct |
| 4 |
Correct |
5 ms |
17240 KB |
Output is correct |
| 5 |
Correct |
42 ms |
20888 KB |
Output is correct |
| 6 |
Correct |
45 ms |
20820 KB |
Output is correct |
| 7 |
Correct |
110 ms |
25336 KB |
Output is correct |
| 8 |
Correct |
144 ms |
30012 KB |
Output is correct |
| 9 |
Correct |
191 ms |
34624 KB |
Output is correct |
| 10 |
Correct |
257 ms |
39252 KB |
Output is correct |
