2015 Multi-University Training Contest 6 hdu 5360 Hiking

Hiking

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 226    Accepted Submission(s): 126
Special Judge

Problem Description

There are n soda conveniently labeled by 1,2,…,n. beta, their best friends, wants to invite some soda to go hiking. The i-th soda will go hiking if the total number of soda that go hiking except him is no less than li and no larger than ri. beta will follow the rules below to invite soda one by one:
1. he selects a soda not invited before;
2. he tells soda the number of soda who agree to go hiking by now;
3. soda will agree or disagree according to the number he hears.

Note: beta will always tell the truth and soda will agree if and only if the number he hears is no less than li and no larger than ri, otherwise he will disagree. Once soda agrees to go hiking he will not regret even if the final total number fails to meet some soda's will.

Help beta design an invitation order that the number of soda who agree to go hiking is maximum.

 

Input

There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:

The first contains an integer n (1≤n≤105), the number of soda. The second line constains n integers l1,l2,…,ln. The third line constains n integers r1,r2,…,rn. (0≤li≤ri≤n)
It is guaranteed that the total number of soda in the input doesn't exceed 1000000. The number of test cases in the input doesn't exceed 600.

 

Output

For each test case, output the maximum number of soda. Then in the second line output a permutation of 1,2,…,n denoting the invitation order. If there are multiple solutions, print any of them.

 

Sample Input

4

8

4 1 3 2 2 1 0 3

5 3 6 4 2 1 7 6

8

3 3 2 0 5 0 3 6

4 5 2 7 7 6 7 6

8

2 2 3 3 3 0 0 2

7 4 3 6 3 2 2 5

8

5 6 5 3 3 1 2 4

6 7 7 6 5 4 3 5

 

Sample Output

7

1 7 6 5 2 4 3 8

8

4 6 3 1 2 5 8 7

7

3 6 7 1 5 2 8 4

0

1 2 3 4 5 6 7 8

 

Source

2015 Multi-University Training Contest 6

 

解题：贪心，先按L排序，再按y排序，把L不大于agree的全部入优先队列，然后进行贪心即可

 

 #include <bits/stdc++.h>
 #define pii pair<int,int>
 using namespace std;
 const int maxn = ;
 struct SODA {
     int l,r,id;
     SODA(int x = ,int y = ,int z = ) {
         l = x;
         r = y;
         id = z;
     }
     bool operator<(const SODA &t) const {
         if(l == t.l) return r < t.r;
         return l < t.l;
     }
     bool operator>(const SODA &t) const {
         return r > t.r;
     }
 } s[maxn];
 struct node {
     int l,r,id;
 };
 priority_queue<SODA,vector<SODA>,greater<SODA> >q;
 vector<int>ans;
 bool vis[maxn];
 int main() {
     int kase,n;
     scanf("%d",&kase);
     while(kase--) {
         scanf("%d",&n);
         for(int i = ; i < n; ++i) {
             scanf("%d",&s[i].l);
             s[i].id = i + ;
         }
         for(int i = ; i < n; ++i)
             scanf("%d",&s[i].r);
         sort(s,s+n);
         int agree = ,cur = ;
         ans.clear();
         bool flag = true;
         memset(vis,false,sizeof vis);
         while(cur < n && flag) {
             while(cur < n && s[cur].l <= agree)
                 q.push(s[cur++]);
             flag = false;
             while(!q.empty()) {
                 int u = q.top().r;
                 if(u >= agree) {
                     ans.push_back(q.top().id);
                     agree++;
                     flag = true;
                     vis[q.top().id] = true;
                     q.pop();
                     break;
                 }
                 q.pop();
             }
         }
         while(!q.empty()) {
             int u = q.top().r;
             if(u >= agree) {
                 ans.push_back(q.top().id);
                 agree++;
                 vis[q.top().id] = true;
             }
             q.pop();
         }
         for(int i = ; i <= n; ++i)
             if(!vis[i]) ans.push_back(i);
         printf("%d\n",agree);
         for(int i = ; i < n; ++i)
             printf("%d%c",ans[i],i+==n?'\n':' ');
     }
     return ;
 }