BNU Training 2015 07 27 题解

<span style="font-size:14px;">// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif

#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

using namespace std;

#define rep(i,j,k) for(int i=(int)j;i<(int)k;++i)
#define per(i,j,k) for(int i=(int)j;i>(int)k;--i)
#define lowbit(a) a&-a
#define Max(a,b) a>b?a:b
#define Min(a,b) a>b?b:a
#define mem(a,b) memset(a,b,sizeof(a))

typedef long long LL;
typedef unsigned long long LLU;
typedef double db;
const int N=1e5;
const int inf=0x3f3f3f3f;

char str[N];
bool vis[N];

int dir4[4][2]= {{1,0},{0,1},{-1,0},{0,-1}};
int dir8[8][2]= {{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};
int movv[5][2]= {{1,0},{0,1},{0,0},{-1,0},{0,-1}};

bool leap_year(int y)
{
    if(y%4==0&&y%100!=0||y%400==0) return 1;
    return 0;
}
inline LL read()
{
    int c=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        c=c*10+ch-'0';
        ch=getchar();
    }
    return c*f;
}

char mon1[N],mon2[N];
LL day1,year1;
LL day2,year2;
LL row,line,x,t,y,i,res;

int main()
{
    scanf("%lld",&t);
    for(i=1; i<=t; ++i)
    {
        int res=0;
        scanf("%s %lld,%lld",mon1,&day1,&year1);
        scanf("%s %lld,%lld",mon2,&day2,&year2);
        if((mon1[0]=='J'&&mon1[1]=='a')||mon1[0]=='F') year1=year1;
        else year1++;
        if((mon2[0]=='J'&&mon2[1]=='a')||mon2[0]=='F'&&day2<=28) year2--;
        res=(year2/4)-((year1-1)/4);
        res=res-(year2/100)+((year1-1)/100);
        res=res+(year2/400)-((year1-1)/400);
        printf("Case %lld: %lld\n",i,res);
    }
    return 0;
}</span>

<span style="font-size:14px;">#include <stdio.h>
#define MAX 50005
int T,N;
int vis[MAX], f[MAX], c[MAX];
int ans, flag;
typedef long long LL;

inline LL read()
{
    int c=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){c=c*10+ch-'0';ch=getchar();}
    return c*f;
}

int dfs(int u)
{
    int v = f[u];/// 2=f[1];1=f[2];2=f[3];
    int r = 0;   ///
    vis[u] = 1;  /// vis[1]=1;vis[2]=1;vis[3]=1;
    if(!vis[v]) r = dfs(v) + 1;///vis[2]=1,r=0+1=1;
    vis[u] = 0;
    c[u] = r;   ///c[1]=1,c[2]=0,c[3]=2;
    return r;
}

int main()
{
    int u,v;
    T=read();
    for(int t=1; t<=T; t++){
        N=read();
        for(int i=1; i<=N; i++){
            u=read(),v=read();
            f[u] = v;
            vis[u] = 0;
            c[u] = -1;
        }
        ans = -1;
        for(int i=1; i<=N; i++){
            if(c[i]==-1) dfs(i);
            if(c[i]>m)
            {
                m=c[i];
                flag=i;
            }
          /*  printf("vertex %d children %d\n",i,c[i]);*/
        }
        printf("Case %d: %d\n",t,flag);
    }
    return 0;
}</span>

版权声明：本文为博主原创文章，未经博主允许不得转载。