BZOJ 3236: [Ahoi2013]作业

3236: [Ahoi2013]作业

Time Limit: 100 Sec  Memory Limit: 512 MB
Submit: 1393  Solved: 562
[Submit][Status][Discuss]

Description

Input

Output

Sample Input

3 4
1 2 2
1 2 1 3
1 2 1 1
1 3 1 3
2 3 2 3

Sample Output

2 2
1 1
3 2
2 1

HINT

N=100000,M=1000000

Source

By wangyisong1996加强数据

[Submit][Status][Discuss]

莫队算法 + 树状数组统计答案

 #include <cmath>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <iostream>
 #include <algorithm>

 using namespace std;

 /* SCANNER */

 #define siz 10000000

 inline char get_a(void) {
     static char buf[siz], *bit = buf;

     if (bit == buf + siz)
         fread(bit = buf, , siz, stdin);

     return *bit++;
 }

 inline int get_i(void) {
     register int ret = ;
     register int neg = false;
     register int bit = get_a();

     for (; bit < ''; bit = get_a())
         if (bit == '-')neg ^= true;

     for (; bit >= ''; bit = get_a())
         ret = ret *  + bit - '';

     return neg ? -ret : ret;
 }

 #define maxn 400005
 #define maxm 1000005

 int s;
 int tot;
 int n, m;
 int num[maxn];
 int cnt[maxn];
 int tmp[maxn];
 int ans1[maxm];
 int ans2[maxm];
 int tree1[maxn];
 int tree2[maxn];

 struct query {
     int l, r, a, b, id;
 }qry[maxm];

 inline int cmp(const void *a, const void *b) {
     query *A = (query *)a;
     query *B = (query *)b;
     if (A->l / s != B->l / s)
         return A->l - B->l;
     else
         return A->r - B->r;
 }

 inline void add(int *t, int p, int k) {
     for (; p <= tot; p += p&-p)
         t[p] += k;
 }

 inline int ask(int *t, int p) {
     int ret = ;
     for (; p; p -= p&-p)
         ret += t[p];
     return ret;
 }

 inline void remove(int t) {
     add(tree1, t, -);
     if (--cnt[t] == )
         add(tree2, t, -);
 }

 inline void insert(int t) {
     add(tree1, t, );
     if (++cnt[t] == )
         add(tree2, t, );
 }

 signed main(void) {
     n = get_i();
     m = get_i();
     s = sqrt(n);

     for (int i = ; i <= n; ++i)
         num[i] = get_i(), tmp[++tot] = num[i];

     for (int i = ; i <= m; ++i) {
         qry[i].id = i;
         qry[i].l = get_i();
         qry[i].r = get_i();
         qry[i].a = get_i();
         qry[i].b = get_i();
     }

     for (int i = ; i <= m; ++i)
         tmp[++tot] = qry[i].a,
         tmp[++tot] = qry[i].b;

     sort(tmp + , tmp +  + tot);

     tot = unique(tmp + , tmp +  + tot) - tmp;

     for (int i = ; i <= n; ++i)
         num[i] = lower_bound(tmp + , tmp + tot, num[i]) - tmp;

     for (int i = ; i <= m; ++i) {
         qry[i].a = lower_bound(tmp + , tmp + tot, qry[i].a) - tmp;
         qry[i].b = lower_bound(tmp + , tmp + tot, qry[i].b) - tmp;
     }

     /*
     for (int i = 1; i <= n; ++i)
         printf("%d ", num[i]);

     puts("");

     for (int i = 1; i <= m; ++i)
         printf("%d %d\n", qry[i].a, qry[i].b);
     */

     qsort(qry + , m, sizeof(query), cmp);

     int l = , r = ;

     for (int i = ; i <= m; ++i) {
         while (l < qry[i].l)remove(num[l++]);
         while (l > qry[i].l)insert(num[--l]);
         while (r < qry[i].r)insert(num[++r]);
         while (r > qry[i].r)remove(num[r--]);
         ans1[qry[i].id] = ask(tree1, qry[i].b) - ask(tree1, qry[i].a - );
         ans2[qry[i].id] = ask(tree2, qry[i].b) - ask(tree2, qry[i].a - );
     }

     for (int i = ; i <= m; ++i)
         printf("%d %d\n", ans1[i], ans2[i]);

     //system("pause");
 }

 #include <cmath>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <iostream>
 #include <algorithm>

 using namespace std;

 /* SCANNER */

 #define siz 50000000

 inline int get_c(void)
 {
     static char buf[siz];
     static char *head = buf;
     static char *tail = buf + siz;

     if (head == tail)
         fread(head = buf, , siz, stdin);

     return *head++;
 }

     #define getc get_c
 //    #define getc getchar

 inline int get_i(void)
 {
     register int ret = ;
     register int neg = false;
     register int bit = getc();

     for (; bit < ''; bit = getc())
         if (bit == '-')neg ^= true;

     for (; bit >= ''; bit = getc())
         ret = ret *  + bit - '';

     return neg ? -ret : ret;
 }

 /* PROBLEM */

 #define maxn 100005
 #define maxm 1000005

 int n, m, s;
 int num[maxn];
 int cnt[maxm * ];
 int tmp[maxm * ];
 int *tot = tmp + ;
 int tree1[maxm * ];
 int tree2[maxm * ];

 /* QRY */

 struct query
 {
     int l, r;
     int a, b;
     int ans1;
     int ans2;
 }qry[maxm], *ord[maxm];

 inline bool cmp(query *a, query *b)
 {
     if (a->l / s != b->l / s)
         return a->l < b->l;
     else
         return a->r < b->r;
 }

 /* BIT */

 inline void add(int *t, int p, int k)
 {
     int len = tot - tmp;
     for (; p <= len; p += p&-p)
         t[p] += k;
 }

 inline int ask(int *t, int p)
 {
     int ret = ;
     for (; p; p -= p&-p)
         ret += t[p];
     return ret;
 }

 /* MOQ */

 inline void insert(int t)
 {
     add(tree1, t, +);
     if (++cnt[t] == )
         add(tree2, t, +);
 }

 inline void remove(int t)
 {
     add(tree1, t, -);
     if (--cnt[t] == )
         add(tree2, t, -);
 }

 /* MAIN */

 signed main(void)
 {
     n = get_i();
     m = get_i();
     s = sqrt(n);

     for (int i = ; i <= n; ++i)
         *tot++ = num[i] = get_i();

     for (int i = ; i <= m; ++i)
     {
         ord[i] = qry + i;
         qry[i].l = get_i();
         qry[i].r = get_i();
         *tot++ = qry[i].a = get_i();
         *tot++ = qry[i].b = get_i();
     }

     sort(tmp + , tot); 

     tot = unique(tmp + , tot);

     for (int i = ; i <= n; ++i)
         num[i] = lower_bound(tmp + , tot, num[i]) - tmp;

     for (int i = ; i <= m; ++i)
     {
         qry[i].a = lower_bound(tmp + , tot, qry[i].a) - tmp;
         qry[i].b = lower_bound(tmp + , tot, qry[i].b) - tmp;
     }

     sort(ord + , ord +  + m, cmp);

     int lt = , rt = ;    // left & right

     for (int i = ; i <= m; ++i)
     {
         query *q = ord[i];
         while (lt < q->l)remove(num[lt++]);
         while (lt > q->l)insert(num[--lt]);
         while (rt < q->r)insert(num[++rt]);
         while (rt > q->r)remove(num[rt--]);
         q->ans1 = ask(tree1, q->b) - ask(tree1, q->a - );
         q->ans2 = ask(tree2, q->b) - ask(tree2, q->a - );
     }

     for (int i = ; i <= m; ++i)
         printf("%d %d\n", qry[i].ans1, qry[i].ans2);

     //system("pause");
 }

@Author: YouSiki