fork download 
  1. #include<stdio.h>
  2. #include<algorithm>
  3. #define bl 174
  4. #define gc getchar_unlocked
  5. #define pc(x) putchar_unlocked(x);
  6.     inline void print(int n)
  7.     {
  8.         int N = n, rev, count = 0;
  9.         rev = N;
  10.         if (N == 0) { pc('0'); pc('\n'); return ;}
  11.         while ((rev % 10) == 0) { count++; rev /= 10;} //obtain the count of the number of 0s
  12.         rev = 0;
  13.         while (N != 0) { rev = (rev<<3) + (rev<<1) + N % 10; N /= 10;}  //store reverse of N in rev
  14.         while (rev != 0) { pc(rev % 10 + '0'); rev /= 10;}
  15.         while (count--) pc('0');
  16.     }
  17. int read_int() {
  18.   char c = gc();
  19.   while(c<'0' || c>'9') c = gc();
  20.   int ret = 0;
  21.   while(c>='0' && c<='9') {
  22.     ret = 10 * ret + c - 48;
  23.     c = gc();
  24.   }
  25.   return ret;
  26. }
  27. typedef long long ll;
  28. struct node{
  29. 	ll l,r,p;
  30. }q[200006];
  31. ll ar[30005],cnt[1000006],answer=0,ans[2000006];
  32. bool sorting(node a,node b)
  33. {
  34. 	if((a.l/bl)!=(b.l)/bl)
  35. 	{
  36. 		return((a.l/bl)<(b.l/bl));
  37. 	}
  38. 	return (a.r<b.r);
  39.  
  40. }
  41. void remove(ll p)
  42. {
  43. 	cnt[ar[p]]--;
  44. 	if(cnt[ar[p]]==0)
  45. 	{
  46. 		answer--;
  47. 	}
  48. }
  49. void add(ll p)
  50. {
  51. 	cnt[ar[p]]++;
  52. 	if(cnt[ar[p]]==1)
  53. 	answer++;
  54. }
  55. int main()
  56. {
  57. 	using namespace std;
  58. 	ll i,m,n;
  59. 	n=read_int();
  60. 	for(i=0;i<n;i++)
  61. 	ar[i]=read_int();
  62. 	m=read_int();
  63. 	for(i=0;i<m;i++)
  64. 	{
  65. 		q[i].l=read_int();
  66. 		q[i].r=read_int();
  67. 		q[i].l--;
  68. 		q[i].r--;
  69. 		q[i].p=i;
  70. 	}
  71. 	sort(q,q+m,sorting);
  72. 	ll cl=0,cr=0,x,y;
  73. 	for(i=0;i<m;i++)
  74. 	{
  75. 		x=q[i].l;
  76. 		y=q[i].r;
  77. 		while(cl<x)
  78. 		{
  79. 			remove(cl);
  80. 			cl++;
  81. 		}
  82. 		while(cl>x)
  83. 		{
  84. 			add(cl-1);
  85. 			cl--;
  86. 		}
  87. 		while(cr<=y)
  88. 		{
  89. 			add(cr);
  90. 			cr++;
  91. 		}
  92. 		while(cr>y+1)
  93. 		{
  94. 			remove(cr-1);
  95. 			cr--;
  96. 		}
  97. 		ans[q[i].p]=answer;
  98. 	}
  99. 	for(i=0;i<m;i++)
  100. 	print(ans[i]);
  101. return 0;
  102. }
Success #stdin #stdout 0s 31824KB
comments (?)
stdin 
3
1 2 3
1
1 2
stdout 
2
https://ideone.com/K1hsjw
language:
C++14 (gcc 8.3)
created:
9 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!