oj.uz

Submission #633455

# Submission time Handle Problem Language Result Execution time Memory
633455 2022-08-22T13:50:55 Z IWTIM Index (COCI21_index) C++14
110 / 110
 798 ms 45696 KB 
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
	vi e; void init(int N) { e = vi(N,-1); }
	int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
	bool sameSet(int a, int b) { return get(a) == get(b); }
	int size(int x) { return -e[get(x)]; }
	bool unite(int x, int y) { // union by size
		x = get(x), y = get(y); if (x == y) return 0;
		if (e[x] > e[y]) swap(x,y);
		e[x] += e[y]; e[y] = x; return 1;
	}
};
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
 
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
const int N = 3e5 + 5;
int t,n,a[N],q,le[N],ri[N],l[N],r[N];
int tree[N];
vector <int> v[N], que[N];
void update(int idx, int val) {
	for (int i = idx; i < N; i+=i&(-i)) {
		tree[i] += val;
	}
}
int getans(int idx) {
	int pas = 0;
	for (int i = idx; i > 0; i-=i&(-i)) {
		pas += tree[i];
	}
	return pas;
}
int get(int le, int ri) {
	return getans(ri) - getans(le - 1);
}
main() {
    std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n>>q;
    for (int i = 1; i <= n; i++) {
    	cin>>a[i];
    	v[a[i]].pb(i);
	}
	for (int i = 1; i <= q; i++) {
		cin>>l[i]>>r[i];
		le[i] = 1;
		ri[i] = 200000;
	}
	int cnt = 0;
	while (true) {
		int ff = 0;
		for (int i = 1; i <= q; i++) {
			if (le[i] != ri[i])
			que[(le[i] + ri[i] + 1)/2].pb(i), ff = 1;
		}
		if (!ff) break;
		for (int i = 200000; i >= 1; i--) {
			for (int id : v[i]) {
				update(id,1);
			}
			for (int idx : que[i]) {
				if (get(l[idx], r[idx]) >= i) le[idx] = i;
				else ri[idx] = i - 1;
			}
			que[i].clear();
		}
		for (int i = 200000; i >= 1; i--) {
			for (int id : v[i]) {
				update(id, -1);
			}
		}
	}
	for (int i = 1; i <= q;i++) {
		cout<<le[i]<<"\n";
	}
}

Compilation message

index.cpp:200:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  200 | main() {
      | ^~~~
index.cpp: In function 'int main()':
index.cpp:212:6: warning: unused variable 'cnt' [-Wunused-variable]
  212 |  int cnt = 0;
      |      ^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 14548 KB Output is correct
2 Correct 21 ms 14560 KB Output is correct
3 Correct 22 ms 14592 KB Output is correct
4 Correct 24 ms 14568 KB Output is correct
5 Correct 22 ms 14520 KB Output is correct
6 Correct 22 ms 14548 KB Output is correct
7 Correct 23 ms 14548 KB Output is correct
8 Correct 23 ms 14568 KB Output is correct
9 Correct 23 ms 14548 KB Output is correct
10 Correct 22 ms 14592 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 14548 KB Output is correct
2 Correct 21 ms 14560 KB Output is correct
3 Correct 22 ms 14592 KB Output is correct
4 Correct 24 ms 14568 KB Output is correct
5 Correct 22 ms 14520 KB Output is correct
6 Correct 22 ms 14548 KB Output is correct
7 Correct 23 ms 14548 KB Output is correct
8 Correct 23 ms 14568 KB Output is correct
9 Correct 23 ms 14548 KB Output is correct
10 Correct 22 ms 14592 KB Output is correct
11 Correct 187 ms 22112 KB Output is correct
12 Correct 194 ms 21976 KB Output is correct
13 Correct 154 ms 21904 KB Output is correct
14 Correct 162 ms 22008 KB Output is correct
15 Correct 172 ms 22012 KB Output is correct
16 Correct 162 ms 21956 KB Output is correct
17 Correct 160 ms 22020 KB Output is correct
18 Correct 169 ms 22048 KB Output is correct
19 Correct 165 ms 22036 KB Output is correct
20 Correct 162 ms 21964 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 14548 KB Output is correct
2 Correct 21 ms 14560 KB Output is correct
3 Correct 22 ms 14592 KB Output is correct
4 Correct 24 ms 14568 KB Output is correct
5 Correct 22 ms 14520 KB Output is correct
6 Correct 22 ms 14548 KB Output is correct
7 Correct 23 ms 14548 KB Output is correct
8 Correct 23 ms 14568 KB Output is correct
9 Correct 23 ms 14548 KB Output is correct
10 Correct 22 ms 14592 KB Output is correct
11 Correct 187 ms 22112 KB Output is correct
12 Correct 194 ms 21976 KB Output is correct
13 Correct 154 ms 21904 KB Output is correct
14 Correct 162 ms 22008 KB Output is correct
15 Correct 172 ms 22012 KB Output is correct
16 Correct 162 ms 21956 KB Output is correct
17 Correct 160 ms 22020 KB Output is correct
18 Correct 169 ms 22048 KB Output is correct
19 Correct 165 ms 22036 KB Output is correct
20 Correct 162 ms 21964 KB Output is correct
21 Correct 715 ms 45452 KB Output is correct
22 Correct 751 ms 45508 KB Output is correct
23 Correct 716 ms 45696 KB Output is correct
24 Correct 695 ms 45452 KB Output is correct
25 Correct 732 ms 45608 KB Output is correct
26 Correct 779 ms 45444 KB Output is correct
27 Correct 798 ms 45296 KB Output is correct
28 Correct 681 ms 45560 KB Output is correct
29 Correct 698 ms 45552 KB Output is correct
30 Correct 761 ms 45272 KB Output is correct