2017年 4 月 9 日 训练题解

A 2010 哈尔滨 F
http://board.acmicpc.info/icpc2010/hrbeu_onsite.php

#include<bits/stdc++.h>
using namespace std;
#define INF 0xfffffff
int ma[15][15];
int main(){
	int N,M,P,S,L;
	while(scanf("%d",&N)!=EOF){
		int to,p,num;
		for(int i=0;i<=N;i++)
		    for(int j=0;j<=N;j++)
			    ma[i][j]=(i==j)?0:INF;
		for(int i=0;i<N;i++){
			scanf("%d%d",&M,&P);
			if(P)ma[i][N]=0;
			for(int j=0;j<M;j++){
				scanf("%d%d",&S,&L);
				ma[i][S]=L;
			}
		}
		for(int k=0;k<=N;k++)
		    for(int i=0;i<=N;i++)
            	for(int j=0;j<=N;j++){
			        ma[i][j]=min(ma[i][j],ma[i][k]+ma[k][j]);
		        }
		printf("%d\n",ma[0][N]);
	}
	return 0;
}

# uvalive 5093 2011 harbin F
import sys
import math


def main():
    for line in sys.stdin:
        n = int(line)
        b = [0 for i in range(n)]

        g = [[math.inf for i in range(n)] for i in range(n)]
        for i in range(n):
            g[i][i] = 0
        for i in range(n):
            mi, b[i] = map(int, input().split())
            for j in range(mi):
                sm, lm = map(int, input().split())
                g[i][sm] = g[sm][i] = lm
        for k in range(n):
            for i in range(n):
                for j in range(n):
                    g[i][j] = min(g[i][j], g[i][k] + g[k][j])
        ans = math.inf
        for i in range(n):
            if b[i]:
                ans = min(ans, g[0][i])
        print(ans)
main()

B 2011 成都 B
http://board.acmicpc.info/icpc2011/ccniit_onsite.php

#include<iostream>
#include<cmath>
using namespace std;

int main ()
{
    int t;
    cin >> t;
    long long n, m, h;
    long long a, b;
    for(int k = 1;k <= t;k++)   {
        cin >> n >> m >> h;
        a = m * n * h - 1;
        b = ceil(1.0 * log(n * 1.0) / log(2.0)) + ceil(1.0 * log(m * 1.0) / log(2.0)) + ceil(1.0 * log(h * 1.0) / log(2.0));
        cout << "Case #" << k << ": " << a << ' ' << b << endl;
    }
    return 0;
}

def binlen(x):
    if x:
        return len(bin(x)) - 2
    return 0
def solve():
    n, m, k = map(int, input().split())
    ans1 = n * m * k - 1
    n, m, k = n - 1, m - 1, k - 1
    ans2 = sum(map(binlen, [n, m, k]))
    return ans1, ans2
t = int(input())
for i in range(1, t+1):
    ans1, ans2 = solve() 
    print("Case #{}: {} {}".format(i, ans1, ans2)

C 2011 大连 D
http://board.acmicpc.info/icpc2011/dlut_onsite.php

import sys
for line in sys.stdin:
    line = line[:-1]
    l = len(line)
    for i in range(0, l, 16):
        print((hex(i)[2:]).zfill(4), end=': ')
        for j in range(i, i + 16, 2):
            if j >= l:
                print('  ', end='')
            else:
                print(hex(ord(line[j]))[2:], end='')
            if j + 1 >= l:
                print('  ', end=' ')
            else:
                print(hex(ord(line[j + 1]))[2:], end=' ')
        print(line[i:i+16].swapcase())

#include
#include
#include
#include
#include

using namespace std;

int main()
{
char s[5001];
while (cin.getline(s,5001))
{
for (int line=0;line<strlen(s);line+=16){
printf("%.4x: “,line);
int i,left=line,right=line+16;
for (i=left;i<right&&i<strlen(s);i++)
{
printf(”%.2x",s[i]);
if (i%21) printf(" “);
}
while (i<right)
{
printf(” ");
if (i%21) printf(" “);
i++;
}
for (i=left;i<right&&i<strlen(s);i++)
{
if (s[i]>=‘A’&&s[i]<=‘Z’) {printf(”%c",tolower(s[i]));continue;}
if (s[i]>=‘a’&&s[i]<=‘z’) {printf("%c",toupper(s[i]));continue;}
printf("%c",s[i]);
}
printf("\n");
}
}
}

D 1988 第一届ACM
https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=441

#include <bits/stdc++.h>
using namespace std;
char s[3][100];a
int main()
{
//freopen(“in”, “r”, stdin);
fgets(s[0], sizeof(s[0]), stdin);
fgets(s[1], sizeof(s[1]), stdin);
while (scanf("%s\n", s[2]) != EOF) {
bool flag = false; //down
int len = strlen(s[2]);
for (int i = 0; i < len; i += 5) {
int x = 0;
for (int j = 0; j < 5; j++) {
x += (s[2][i + 4 - j] - ‘0’) * (1<<j);
}
if (x == ((1<<5) - 1 - (1<<2))) flag = false;
else if (x == ((1<<5) - 1)) flag = true;
else printf("%c", s[flag][x]);
}
printf("\n");
}
}

s = [input(), input()]
try:
while True:
s2 = input()
flag = 0
for i in range(0, len(s2), 5):
x = 0
for j in range(0, 5):
x += (ord(s2[i + 4 - j]) - ord(‘0’)) * (1 << j)
if x is (1 << 5) - 1 - (1 << 2):
flag = 0
elif x is (1 << 5) - 1:
flag = 1
else:
print(s[flag][x], end=’’)
print()
except EOFError:
pass