#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define vi vector<int>
#define ve vector
#define ll long long
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define onbit __builtin_popcount
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e18
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll MOD = 1e9+7;
const int nax = 5e5+5;
const int MAX_VAL = 1e6;
double PI=3.14159265359;
int arx[8]={1,1,0,-1,-1,-1, 0, 1};
int ary[8]={0,1,1, 1, 0,-1,-1,-1};
/*typedef complex<int> Point;
#define X real()
#define Y imag()*/
/*void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}*/
vii tab(nax);
Tree<ii> segtree[nax*4];
void build(int pos,int l,int r)
{
if (l==r)
{
segtree[pos].insert(tab[l]);
return;
}
int mid=(r+l)/2;
build(pos*2+1,l,mid);
build(pos*2+2,mid+1,r);
for (auto u: segtree[pos*2+1])
{
segtree[pos].insert(u);
}
for (auto u: segtree[pos*2+2])
{
segtree[pos].insert(u);
}
return;
}
void update(int pos,int l,int r,int index,ii newvalue)
{
if (l>r) return;
segtree[pos].erase(tab[index]);
if (l==r&&r==index)
{
segtree[pos].insert(newvalue);
return;
}
int mid=(r+l)/2;
if (index<=mid) update(pos*2+1,l,mid,index,newvalue);
else update(pos*2+2,mid+1,r,index,newvalue);
segtree[pos].insert(newvalue);
}
int query(int pos,int l,int r,int left,int right)
{
if (l>r||r<left||l>right) return 0;
else if (l>=left&&r<=right)
{
int sum=segtree[pos].order_of_key({tab[right]});
return sum;
}
int mid=(r+l)/2;
return query(pos*2+1,l,mid,left,right)+query(pos*2+2,mid+1,r,left,right);
}
std::vector<int> countScans(std::vector<int> A, std::vector<int> X, std::vector<int> V){
int n,q;
n=A.size();
q=X.size();
Tree<ii> s;
for (int i = 0; i < n; ++i)
{
tab[i].fi=A[i];
tab[i].se=i;
s.insert(tab[i]);
}
ll res=0;
build(0,0,n-1);
vector<bool> test(n);
for (int i = 0; i < n; ++i)
{
int p=s.order_of_key(tab[i]);
int k=query(0,0,n-1,0,i);
if (k!=p) {
test[i]=true;
res++;
}else test[i]=false;
}
vi nabba;
for (int i = 0; i < q; ++i)
{
int x,y;
x=X[i];
y=V[i];
s.erase(tab[x]);
int t=s.order_of_key({y,x});
update(0,0,n-1,x,{y,x});
s.insert({y,x});
tab[x]={y,x};
for (int j = 0; j < n; ++j)
{
int p=s.order_of_key(tab[j]);
int k=query(0,0,n-1,0,j);
//cout <<j<<" "<<tab[j].fi<<" "<< p<<" "<<j-k<<endl;
if (k!=p)
{
if (test[j]==false) res++;
test[j]=true;
}else{
if (test[j]==true) res--;
test[j]=false;
}
}
nabba.pb(res);
}
return nabba;
}
/*int main(){
optimise;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
//setIO("cowland");
}*/
Compilation message
bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:116:13: warning: unused variable 't' [-Wunused-variable]
116 | int t=s.order_of_key({y,x});
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
236 ms |
192448 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
236 ms |
192448 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
9084 ms |
221352 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
236 ms |
192448 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
