zoukankan      html  css  js  c++  java
  • ZOJ 3888 Twelves Monkeys

    Twelves Monkeys

    Time Limit: 5000ms
    Memory Limit: 32768KB
    This problem will be judged on ZJU. Original ID: 3888
    64-bit integer IO format: %lld      Java class name: Main
     

    James Cole is a convicted criminal living beneath a post-apocalyptic Philadelphia. Many years ago, the Earth's surface had been contaminated by a virus so deadly that it forced the survivors to move underground. In the years that followed, scientists had engineered an imprecise form of time travel. To earn a pardon, Cole allows scientists to send him on dangerous missions to the past to collect information on the virus, thought to have been released by a terrorist organization known as the Army of the Twelve Monkeys.

    The time travel is powerful so that sicentists can send Cole from year x[i] back to year y[i]. Eventually, Cole finds that Goines is the founder of the Army of the Twelve Monkeys, and set out in search of him. When they find and confront him, however, Goines denies any involvement with the viruscan. After that, Cole goes back and tells scientists what he knew. He wants to quit the mission to enjoy life. He wants to go back to the any year before current year, but scientists only allow him to use time travel once. In case of failure, Cole will find at least one route for backup. Please help him to calculate how many years he can go with at least two routes.

    Input

    The input file contains multiple test cases.

    The first line contains three integers n,m,q(1≤ n ≤ 50000, 1≤ m ≤ 50000, 1≤ q ≤ 50000), indicating the maximum year, the number of time travel path and the number of queries.

    The following m lines contains two integers x,y(1≤ y  x ≤ 50000) indicating Cole can travel from year x to year y.

    The following q lines contains one integers p(1≤ p ≤ n) indicating the year Cole is at now

    Output

    For each test case, you should output one line, contain a number which is the total number of the year Cole can go.

    Sample Input

    9 3 3
    9 1
    6 1
    4 1
    6
    7
    2
    

    Sample Output

    5
    0
    1
    

    Hint

    6 can go back to 1 for two route.

    One is 6-1, the other is 6-7-8-9-1. 6 can go back to 2 for two route.

    One is 6-1-2, the other is 6-7-8-9-1-2.

     

    Source

    Author

    GAN, Tiansheng
     
    解题:离线二分BIT
     
     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 const int maxn = 100001;
     4 struct QU {
     5     int id,year;
     6     bool operator<(const QU &t)const {
     7         if(year == t.year) return id < t.id;
     8         return year > t.year;
     9     }
    10 } Q[maxn];
    11 int c[maxn];
    12 vector<int>g[maxn];
    13 void add(int i,int val) {
    14     while(i < maxn) {
    15         c[i] += val;
    16         i += i&-i;
    17     }
    18 }
    19 int sum(int i,int ret = 0) {
    20     while(i > 0) {
    21         ret += c[i];
    22         i -= i&-i;
    23     }
    24     return ret;
    25 }
    26 int query(int low = 1,int high = maxn-1,int ret = -1) {
    27     while(low <= high) {
    28         int mid = (low + high)>>1;
    29         if(sum(mid) >= 2) {
    30             ret = mid;
    31             high = mid-1;
    32         } else low = mid + 1;
    33     }
    34     return ret;
    35 }
    36 int ans[maxn];
    37 int main() {
    38     int n,m,q,x,y;
    39     while(~scanf("%d%d%d",&n,&m,&q)) {
    40         for(int i = 0; i < maxn; ++i) g[i].clear();
    41         memset(c,0,sizeof c);
    42         memset(ans,0,sizeof ans);
    43         for(int i = 0; i < m; ++i) {
    44             scanf("%d%d",&x,&y);
    45             g[x].push_back(y);
    46         }
    47         for(int i = 0; i < q; ++i) {
    48             scanf("%d",&Q[i].year);
    49             Q[i].id = i;
    50         }
    51         sort(Q,Q+q);
    52         int now = 0;
    53         for(int i = n; i >= 1; --i) {
    54             for(int j = g[i].size()-1; j >= 0; --j)
    55                 add(g[i][j],1);
    56             if(Q[now].year == i) {
    57                 int idx = query(1,i-1);
    58                 if(idx == -1) ans[Q[now].id] = 0;
    59                 else ans[Q[now].id] = i - idx;
    60                 if(++now == q) break;
    61             }
    62         }
    63         for(int i = 0; i < q; ++i)
    64             printf("%d
    ",ans[i]);
    65     }
    66     return 0;
    67 }
    View Code
  • 相关阅读:
    作业29——制作首页的显示列表。
    作业28——发布功能完成。
    作业27——登录之后更新导航
    作业26——完成登录功能,用session记住用户名
    作业25——完成注册功能
    作业24——通过用户模型,对数据库进行增删改查操作。
    作业23——连接mysql数据库,创建用户模型
    作业22——管理信息系统的开发与管理
    作业——21加载静态文件,父模板的继承和扩展
    值类型与引用类型区别
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/4755641.html
Copyright © 2011-2022 走看看