oj.uz

Submission #156152

# Submission time Handle Problem Language Result Execution time Memory
156152 2019-10-03T19:11:45 Z wildturtle Arranging Shoes (IOI19_shoes) C++14
0 / 100
 23 ms 19448 KB 
#include "shoes.h"
long long a,b,c,d,i,e,f,g,n,m,k,l,ans,idx,tree[200005],fix[200005],A[200005],B[200005],le,ri;
std::vector <long long> L[200005],R[200005];
void upd(long long node,long long tl,long long tr,long long pos){
	if(tl==tr) { tree[node]=1; return; }
	long long mid=(tl+tr)/2;
	if(pos<=mid) upd(node*2,tl,mid,pos);
	else upd(node*2+1,mid+1,tr,pos);
	tree[node]=tree[node*2]+tree[node*2+1];
}
long long get(long long node,long long tl,long long tr){
	if(ri<tl || tr<le) return 0;
	if(tr<=ri && le<=tl) return tree[node];
	long long mid=(tr+tl)/2;
	long long x=get(node*2,tl,mid);
	long long y=get(node*2+1,mid+1,tr);
	return x+y;
}
long long count_swaps(std::vector<int> s) {
           n=s.size();
           for(long long i=0;i<n;i++) {
                      if(s[i]<0) {
                                 L[-s[i]].push_back(i);
                      }
                      else {
                                 R[s[i]].push_back(i);
                      }
           }
           for(long long i=0;i<n;i++) {
                      if(fix[i]==0) {
                                 if(s[i]<0) {
                                            idx=L[-s[i]][A[-s[i]]];
                                            ri=idx;
                                            le=i;
                                            ans+=(ri-le-1-get(1,0,n-1));
                                            A[-s[i]]++;
                                            B[-s[i]]++;
                                            fix[idx]++;
                                            upd(1,0,n-1,idx);
                                 }
                                 else {
                                            idx=R[s[i]][B[s[i]]];   
                                            ri=idx;
                                            le=i;
                                            ans+=(ri-le-1-get(1,0,n-1));
                                            A[s[i]]++;
                                            B[s[i]]++;
                                            fix[idx]++;
                                            upd(1,0,n-1,idx);
                                 }
                      }
           }
           return ans;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 19448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 19448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 19448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 22 ms 19448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 19448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 19448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -