ural 2073. Log Files

2073. Log Files

Time limit: 1.0 second
Memory limit: 64 MB

Nikolay has decided to become the best programmer in the world! Now he regularly takes part in various programming contests, attentively listens to problems analysis and upsolves problems. But the point is that he had participated in such a number of contests that got totally confused, which problems had already been solved and which had not. So Nikolay conceived to make a program that could read contests’ logs and build beautiful summary table of the problems. Nikolay is busy participating in a new contest so he has entrusted this task to you!

Input

The first line contains an integer n (1 ≤ n ≤ 100). It‘s the number of contests‘ descriptions. Then descriptions are given. The first line of description consists of from 1 to 30 symbols — Latin letters, digits and spaces — and gives the name of contest. It‘s given that the name doesn‘t begin and doesn’t end with a space. In the second line of description the date of contest in DD.MM.YY format is given. It‘s also given that the date is correct and YY can be from 00 to 99 that means date from 2000 till 2099. In the third line of description there are numbers p and sseparated by space (1 ≤ p ≤ 13, 0 ≤ s ≤ 100). It‘s amount of problems and Nikolay’s submits in the contest. Then s lines are given. These are submits’ descriptions. Description of each submit consists of the problem‘s letter and the judge verdict separated by space. The letter of the problem is the title Latin letter and all problems are numbered by first p letters of English alphabet. The judge verdict can be one of the following: Accepted, Wrong Answer, Runtime Error, Time Limit Exceeded, Memory Limit Exceeded, Compilation Error.

Output

Print the table, which consists of n+1 lines and 3 columns. Each line (except the first) gives the description of the contest. The first column gives the name of the contest, the second column gives the date of the contest (exactly as it was given in the input), the third column gives the description of the problems. Every description of problems is the line of 13 characters, where thei-th character correlate with the i-th problem. If the problem got verdict Accepted at least one time, this character is ’o’. If the problem was submitted at least once but wasn’t accepted, the character is ’x’. If the problem was just given at the contest but wasn’t submitted, the character is ’.’. Otherwise, the character is ’ ’ (space). Contests in the table must be placed in the same order as in input.

Column with the name of the contest consists of 30 symbols (shorter names must be extended by spaces added to the right to make this length). Columns with the date and description of problems consist of 8 and 13 characters accordingly.

The first line of the table gives the names of columns. The boundaries of the table are formatted by ’|’, ’-’ и ’+’ symbols. To get detailed understanding of the output format you can look at the example.

Sample

input	output
2 Codeforces Gamma Round 512 29.02.16 5 4 A Accepted B Accepted C Accepted E Accepted URKOP 17.10.15 12 11 A Accepted B Wrong Answer B Time Limit Exceeded J Accepted B Accepted J Time Limit Exceeded J Accepted F Accepted E Runtime Error H Accepted E Runtime Error	+------------------------------+--------+-------------+ |Contest name |Date |ABCDEFGHIJKLM| +------------------------------+--------+-------------+ |Codeforces Gamma Round 512 |29.02.16|ooo.o | +------------------------------+--------+-------------+ |URKOP |17.10.15|oo..xo.o.o.. | +------------------------------+--------+-------------+

Problem Author: Kirill Borozdin (prepared by Kirill Borozdin, Alexey Danilyuk)
Problem Source: Ural Regional School Programming Contest 2015

Tags: none  (hide tags for unsolved problems)

Difficulty: 158 

大模拟

 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <cmath>
 #include <deque>
 #include <vector>
 #include <queue>
 #include <iostream>
 #include <algorithm>
 #include <map>
 #include <set>
 #include <ctime>
 #include <iomanip>
 using namespace std;

 const int M = ;
 char state[M];

 inline void solve()
 {
     char str[M];
     for(int i = ; i < M; i++) str[i] = ' ';

     gets(str);
     for(int i = strlen(str); i < M; i++) str[i] = ' ';
     printf("|");
     for(int i = ; i < ; i++) printf("%c", str[i]);

     gets(str);
     for(int i = strlen(str); i < M; i++) str[i] = ' ';
     printf("|");
     for(int i = ; i < ; i++) printf("%c", str[i]);

     int n, m;
     scanf("%d%d", &n, &m);
     getchar();
     for(int i = ; i < M; i++) state[i] = ' ';
     for(int i = ; i < n; i++) state[i] = '.';
     while(m--)
     {
         char pro = getchar();
         getchar();
         gets(str);
         int x = pro - 'A';
         if(str[] == 'A') state[x] = 'o';
         else if(state[x] != 'o') state[x] = 'x';
     }
     printf("|");
     for(int i = ; i < ; i++) printf("%c", state[i]);

     printf("|\n");
 }

 int main()
 {
     puts("+------------------------------+--------+-------------+");
     puts("|Contest name                  |Date    |ABCDEFGHIJKLM|");

     int t;
     scanf("%d", &t);
     getchar();
     while(t--)
     {
         puts("+------------------------------+--------+-------------+");
         solve();
     }
     puts("+------------------------------+--------+-------------+");
     return ;
 }