oj.uz

Submission #169285

# Submission time Handle Problem Language Result Execution time Memory
169285 2019-12-19T13:23:28 Z anubhavdhar Arranging Shoes (IOI19_shoes) C++14
100 / 100
 487 ms 283000 KB 
#include<bits/stdc++.h>
 
#define ll long long int 
#define FOR(i,N) for(i=0;i<N;i++)
#define FORe(i,N) for(i=1;i<=N;i++)
#define FORr(i,a,b) for(i=a;i<b;i++)
#define ii pair<ll,ll>
#define vi vector<ll> 
#define vii vector<ii>
#define ff first
#define ppppppppp second 
#define mp make_pair 
#define pb push_back
 
using namespace std;
 
//#include "shoes.h"
/*
const ll MAXN = 1e5+5;
const ll INF = 1e17 + 9;
const ll MOD = 1e9 + 7;
const ll INT_BITS = 31;
const ll LOGN = 17;
*/

#define MAXN 200005

struct SegTree
{
	ll st[4*MAXN];
	void upd(ll node,ll ss,ll se,ll i)
	{
		if (i >se or i< ss)
			return;
		if (ss == se)
		{
			st[node] = 1;
			return;
		}
		ll mid = (ss+se)/2;
		upd(node*2+1,ss,mid,i);
		upd(node*2+2,mid+1,se,i);
		st[node] = st[node*2+1]+st[node*2+2];
	}
	ll quer(ll node, ll ss, ll se,ll l,ll r)
	{
		if (l>se or r<ss)
			return 0;
		if (l <= ss and r >=se)
			return st[node];
		ll mid = (ss+se)/2;
		return quer(node*2+1,ss,mid,l,r)+quer(node*2+2,mid+1,se,l,r);
	}
	SegTree()
	{
		ll i;
		FOR(i,4*MAXN)
			st[i] = 0;
	}
	inline void update(ll i)
	{
		upd(0,0,MAXN,i);
	}
	inline ll query(ll l,ll r)
	{
		return quer(0,0,MAXN,l,r);
	}
};

long long count_swaps(vector<int>s) 
{
	//cout<<"p\n";
	ll N,i,j,l,r,ans = 0;
	//cin>>N;
	N = s.size();
	SegTree S;
	ll A[N],pr[N];
	queue<ll> L[1 + N],R[N+1];
	bool rem[N];
	FOR(i,N)
	{
		A[i] = s[i];
		//cout<<"entering for i = "<<i<<endl;
		rem[i] = false;
		if (A[i] < 0) // Left shoe
		{
			if (!R[-A[i]].empty())
			{
				r = R[-A[i]].front();
				R[-A[i]].pop();
				pr[r] = i;
				pr[i] = r;
				A[i] *= -1;
				A[r] *= -1;
				ans++;
			}
			else
				L[-A[i]].push(i);
		}
		else if (A[i] > 0) // Right Shoe;
		{
			if (!L[A[i]].empty())
			{
				l = L[A[i]].front();
				L[A[i]].pop();
				pr[l] = i;
				pr[i] = l;
			}
			else
				R[A[i]].push(i);
		}
	}
    /*
	FOR(i,N)
		cout<<A[i]<<" ";
	cout<<endl;
	FOR(i,N)
		cout<<pr[i]<<" ";
	cout<<endl;
    */
	FOR(i,N)
	{
		if(A[i] < 0)
		{
			ans += pr[i]-i-1;
			ans -= S.query(i,pr[i]);
			/*for(j = i + 1;j<pr[i];j++)
				if (rem[j])
					ans--;*/
			S.update(pr[i]);
			rem[pr[i]] = true;
		}
 
	}
	return ans;
}
/*
int main()
{
	ll i,n;
	cin>>n;
	vector<int> s(2*n);
	FOR(i,2*n)
		cin>>s[i];
	//cout<<"input taken\n";
	i = count_swaps(s);
	cout<<i<<endl;
	return 0;
}*/

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:73:9: warning: unused variable 'j' [-Wunused-variable]
  ll N,i,j,l,r,ans = 0;
         ^
shoes.cpp:79:7: warning: variable 'rem' set but not used [-Wunused-but-set-variable]
  bool rem[N];
       ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6520 KB Output is correct
2 Correct 6 ms 6520 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6520 KB Output is correct
2 Correct 6 ms 6520 KB Output is correct
3 Correct 7 ms 6520 KB Output is correct
4 Correct 7 ms 6520 KB Output is correct
5 Correct 7 ms 6520 KB Output is correct
6 Correct 7 ms 6620 KB Output is correct
7 Correct 7 ms 6520 KB Output is correct
8 Correct 7 ms 6520 KB Output is correct
9 Correct 7 ms 6520 KB Output is correct
10 Correct 7 ms 6504 KB Output is correct
11 Correct 7 ms 6620 KB Output is correct
12 Correct 7 ms 6648 KB Output is correct
13 Correct 7 ms 6648 KB Output is correct
14 Correct 7 ms 6520 KB Output is correct
15 Correct 7 ms 6648 KB Output is correct
16 Correct 7 ms 6520 KB Output is correct
17 Correct 7 ms 6648 KB Output is correct
18 Correct 7 ms 6648 KB Output is correct
19 Correct 7 ms 6648 KB Output is correct
20 Correct 7 ms 6648 KB Output is correct
21 Correct 7 ms 6648 KB Output is correct
22 Correct 7 ms 6648 KB Output is correct
23 Correct 7 ms 6648 KB Output is correct
24 Correct 7 ms 6648 KB Output is correct
25 Correct 7 ms 6648 KB Output is correct
26 Correct 7 ms 6648 KB Output is correct
27 Correct 7 ms 6520 KB Output is correct
28 Correct 7 ms 6648 KB Output is correct
29 Correct 7 ms 6648 KB Output is correct
30 Correct 7 ms 6520 KB Output is correct
31 Correct 7 ms 6648 KB Output is correct
32 Correct 7 ms 6648 KB Output is correct
33 Correct 7 ms 6648 KB Output is correct
34 Correct 7 ms 6648 KB Output is correct
35 Correct 7 ms 6648 KB Output is correct
36 Correct 7 ms 6648 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6520 KB Output is correct
2 Correct 6 ms 6520 KB Output is correct
3 Correct 7 ms 6520 KB Output is correct
4 Correct 7 ms 6524 KB Output is correct
5 Correct 7 ms 6648 KB Output is correct
6 Correct 7 ms 6620 KB Output is correct
7 Correct 7 ms 6500 KB Output is correct
8 Correct 7 ms 6648 KB Output is correct
9 Correct 7 ms 6648 KB Output is correct
10 Correct 7 ms 6504 KB Output is correct
11 Correct 7 ms 6516 KB Output is correct
12 Correct 7 ms 6520 KB Output is correct
13 Correct 7 ms 6520 KB Output is correct
14 Correct 7 ms 6520 KB Output is correct
15 Correct 7 ms 6648 KB Output is correct
16 Correct 7 ms 6904 KB Output is correct
17 Correct 8 ms 7416 KB Output is correct
18 Correct 12 ms 9324 KB Output is correct
19 Correct 10 ms 9336 KB Output is correct
20 Correct 42 ms 34040 KB Output is correct
21 Correct 42 ms 34168 KB Output is correct
22 Correct 360 ms 280696 KB Output is correct
23 Correct 350 ms 281156 KB Output is correct
24 Correct 358 ms 280952 KB Output is correct
25 Correct 361 ms 281848 KB Output is correct
26 Correct 361 ms 282104 KB Output is correct
27 Correct 350 ms 281848 KB Output is correct
28 Correct 363 ms 282872 KB Output is correct
29 Correct 362 ms 282872 KB Output is correct
30 Correct 366 ms 282872 KB Output is correct
31 Correct 361 ms 282104 KB Output is correct
32 Correct 362 ms 282872 KB Output is correct
33 Correct 362 ms 282744 KB Output is correct
34 Correct 364 ms 283000 KB Output is correct
35 Correct 7 ms 6648 KB Output is correct
36 Correct 7 ms 6520 KB Output is correct
37 Correct 361 ms 282872 KB Output is correct
38 Correct 362 ms 282976 KB Output is correct
39 Correct 362 ms 283000 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6520 KB Output is correct
2 Correct 7 ms 6648 KB Output is correct
3 Correct 7 ms 6520 KB Output is correct
4 Correct 7 ms 6620 KB Output is correct
5 Correct 407 ms 281116 KB Output is correct
6 Correct 443 ms 282128 KB Output is correct
7 Correct 455 ms 282176 KB Output is correct
8 Correct 364 ms 282872 KB Output is correct
9 Correct 421 ms 282060 KB Output is correct
10 Correct 382 ms 282216 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6520 KB Output is correct
2 Correct 6 ms 6520 KB Output is correct
3 Correct 7 ms 6520 KB Output is correct
4 Correct 7 ms 6520 KB Output is correct
5 Correct 7 ms 6520 KB Output is correct
6 Correct 7 ms 6620 KB Output is correct
7 Correct 7 ms 6520 KB Output is correct
8 Correct 7 ms 6520 KB Output is correct
9 Correct 7 ms 6520 KB Output is correct
10 Correct 7 ms 6504 KB Output is correct
11 Correct 7 ms 6620 KB Output is correct
12 Correct 7 ms 6648 KB Output is correct
13 Correct 7 ms 6648 KB Output is correct
14 Correct 7 ms 6520 KB Output is correct
15 Correct 7 ms 6648 KB Output is correct
16 Correct 7 ms 6520 KB Output is correct
17 Correct 7 ms 6648 KB Output is correct
18 Correct 7 ms 6648 KB Output is correct
19 Correct 7 ms 6648 KB Output is correct
20 Correct 7 ms 6648 KB Output is correct
21 Correct 7 ms 6648 KB Output is correct
22 Correct 7 ms 6648 KB Output is correct
23 Correct 7 ms 6648 KB Output is correct
24 Correct 7 ms 6648 KB Output is correct
25 Correct 7 ms 6648 KB Output is correct
26 Correct 7 ms 6648 KB Output is correct
27 Correct 7 ms 6520 KB Output is correct
28 Correct 7 ms 6648 KB Output is correct
29 Correct 7 ms 6648 KB Output is correct
30 Correct 7 ms 6520 KB Output is correct
31 Correct 7 ms 6648 KB Output is correct
32 Correct 7 ms 6648 KB Output is correct
33 Correct 7 ms 6648 KB Output is correct
34 Correct 7 ms 6648 KB Output is correct
35 Correct 7 ms 6648 KB Output is correct
36 Correct 7 ms 6648 KB Output is correct
37 Correct 7 ms 6648 KB Output is correct
38 Correct 7 ms 6648 KB Output is correct
39 Correct 7 ms 6904 KB Output is correct
40 Correct 8 ms 7416 KB Output is correct
41 Correct 10 ms 9336 KB Output is correct
42 Correct 10 ms 9284 KB Output is correct
43 Correct 10 ms 9336 KB Output is correct
44 Correct 10 ms 9336 KB Output is correct
45 Correct 10 ms 9336 KB Output is correct
46 Correct 9 ms 9336 KB Output is correct
47 Correct 10 ms 9336 KB Output is correct
48 Correct 9 ms 9336 KB Output is correct
49 Correct 10 ms 9336 KB Output is correct
50 Correct 10 ms 9336 KB Output is correct
51 Correct 10 ms 9336 KB Output is correct
52 Correct 10 ms 9340 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6520 KB Output is correct
2 Correct 6 ms 6520 KB Output is correct
3 Correct 7 ms 6520 KB Output is correct
4 Correct 7 ms 6520 KB Output is correct
5 Correct 7 ms 6520 KB Output is correct
6 Correct 7 ms 6620 KB Output is correct
7 Correct 7 ms 6520 KB Output is correct
8 Correct 7 ms 6520 KB Output is correct
9 Correct 7 ms 6520 KB Output is correct
10 Correct 7 ms 6504 KB Output is correct
11 Correct 7 ms 6620 KB Output is correct
12 Correct 7 ms 6648 KB Output is correct
13 Correct 7 ms 6648 KB Output is correct
14 Correct 7 ms 6520 KB Output is correct
15 Correct 7 ms 6648 KB Output is correct
16 Correct 7 ms 6520 KB Output is correct
17 Correct 7 ms 6648 KB Output is correct
18 Correct 7 ms 6648 KB Output is correct
19 Correct 7 ms 6648 KB Output is correct
20 Correct 7 ms 6648 KB Output is correct
21 Correct 7 ms 6648 KB Output is correct
22 Correct 7 ms 6648 KB Output is correct
23 Correct 7 ms 6648 KB Output is correct
24 Correct 7 ms 6648 KB Output is correct
25 Correct 7 ms 6648 KB Output is correct
26 Correct 7 ms 6648 KB Output is correct
27 Correct 7 ms 6520 KB Output is correct
28 Correct 7 ms 6648 KB Output is correct
29 Correct 7 ms 6648 KB Output is correct
30 Correct 7 ms 6520 KB Output is correct
31 Correct 7 ms 6648 KB Output is correct
32 Correct 7 ms 6648 KB Output is correct
33 Correct 7 ms 6648 KB Output is correct
34 Correct 7 ms 6648 KB Output is correct
35 Correct 7 ms 6648 KB Output is correct
36 Correct 7 ms 6648 KB Output is correct
37 Correct 7 ms 6520 KB Output is correct
38 Correct 7 ms 6524 KB Output is correct
39 Correct 7 ms 6648 KB Output is correct
40 Correct 7 ms 6620 KB Output is correct
41 Correct 7 ms 6500 KB Output is correct
42 Correct 7 ms 6648 KB Output is correct
43 Correct 7 ms 6648 KB Output is correct
44 Correct 7 ms 6504 KB Output is correct
45 Correct 7 ms 6516 KB Output is correct
46 Correct 7 ms 6520 KB Output is correct
47 Correct 7 ms 6520 KB Output is correct
48 Correct 7 ms 6520 KB Output is correct
49 Correct 7 ms 6648 KB Output is correct
50 Correct 7 ms 6904 KB Output is correct
51 Correct 8 ms 7416 KB Output is correct
52 Correct 12 ms 9324 KB Output is correct
53 Correct 10 ms 9336 KB Output is correct
54 Correct 42 ms 34040 KB Output is correct
55 Correct 42 ms 34168 KB Output is correct
56 Correct 360 ms 280696 KB Output is correct
57 Correct 350 ms 281156 KB Output is correct
58 Correct 358 ms 280952 KB Output is correct
59 Correct 361 ms 281848 KB Output is correct
60 Correct 361 ms 282104 KB Output is correct
61 Correct 350 ms 281848 KB Output is correct
62 Correct 363 ms 282872 KB Output is correct
63 Correct 362 ms 282872 KB Output is correct
64 Correct 366 ms 282872 KB Output is correct
65 Correct 361 ms 282104 KB Output is correct
66 Correct 362 ms 282872 KB Output is correct
67 Correct 362 ms 282744 KB Output is correct
68 Correct 364 ms 283000 KB Output is correct
69 Correct 7 ms 6648 KB Output is correct
70 Correct 7 ms 6520 KB Output is correct
71 Correct 361 ms 282872 KB Output is correct
72 Correct 362 ms 282976 KB Output is correct
73 Correct 362 ms 283000 KB Output is correct
74 Correct 7 ms 6520 KB Output is correct
75 Correct 7 ms 6648 KB Output is correct
76 Correct 7 ms 6520 KB Output is correct
77 Correct 7 ms 6620 KB Output is correct
78 Correct 407 ms 281116 KB Output is correct
79 Correct 443 ms 282128 KB Output is correct
80 Correct 455 ms 282176 KB Output is correct
81 Correct 364 ms 282872 KB Output is correct
82 Correct 421 ms 282060 KB Output is correct
83 Correct 382 ms 282216 KB Output is correct
84 Correct 7 ms 6648 KB Output is correct
85 Correct 7 ms 6648 KB Output is correct
86 Correct 7 ms 6904 KB Output is correct
87 Correct 8 ms 7416 KB Output is correct
88 Correct 10 ms 9336 KB Output is correct
89 Correct 10 ms 9284 KB Output is correct
90 Correct 10 ms 9336 KB Output is correct
91 Correct 10 ms 9336 KB Output is correct
92 Correct 10 ms 9336 KB Output is correct
93 Correct 9 ms 9336 KB Output is correct
94 Correct 10 ms 9336 KB Output is correct
95 Correct 9 ms 9336 KB Output is correct
96 Correct 10 ms 9336 KB Output is correct
97 Correct 10 ms 9336 KB Output is correct
98 Correct 10 ms 9336 KB Output is correct
99 Correct 10 ms 9340 KB Output is correct
100 Correct 10 ms 9336 KB Output is correct
101 Correct 45 ms 34040 KB Output is correct
102 Correct 44 ms 34032 KB Output is correct
103 Correct 431 ms 281956 KB Output is correct
104 Correct 371 ms 282028 KB Output is correct
105 Correct 392 ms 282104 KB Output is correct
106 Correct 401 ms 282132 KB Output is correct
107 Correct 375 ms 281976 KB Output is correct
108 Correct 369 ms 281976 KB Output is correct
109 Correct 364 ms 282872 KB Output is correct
110 Correct 364 ms 282872 KB Output is correct
111 Correct 407 ms 282028 KB Output is correct
112 Correct 487 ms 281976 KB Output is correct
113 Correct 404 ms 282148 KB Output is correct
114 Correct 404 ms 282188 KB Output is correct
115 Correct 397 ms 282056 KB Output is correct