#179978 (C++11（廃止可能性あり）) No.43 野球の試合

• 問題: No.43 野球の試合
• ユーザー: mafuyu-aki
• 提出日時: 2017-06-13 22:50:19
• 言語: C++11（廃止可能性あり） (gcc 13.3.0)
• 結果: WA
• 実行時間: -
• コード長: 1,692 bytes
• コンパイル時間: 235 ms
• コンパイル使用メモリ: 31,872 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-24 17:03:30
• 合計ジャッジ時間: 803 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
sample	AC * 4
other	AC * 5 WA * 2

コンパイルメッセージ

main.cpp: In function ‘int main(int, char**)’:
main.cpp:93:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   93 |         scanf("%d", &N);
      |         ~~~~~^~~~~~~~~~
main.cpp:100:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  100 |                 scanf("%s", s[i]);
      |                 ~~~~~^~~~~~~~~~~~

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define READ_BUFSIZE ( 1024 )
#define READ_DELIMITER ( " " )
int count(char* pS, char c)
{
    int count = 0;
    for (int i = 0; i < strlen(pS); i++)
    {
        if (pS[i] == c)
            count++;
    }
    return(count);
}
int hantei(int N, char ps[6][7])
{
    int K = count(ps[0], 'o');
    if (K == N-1)
        return 1;
    int kachi[7] = { 0 };
    for (int i = 1; i < N; i++)
    {
        kachi[count(ps[i], 'o')] = 1;
    }
    int jun = 0;
    for (int j = K+1; j <= 6; j++)
    {
        if (kachi[j] == 1)
            jun++;
    }
    return(++jun);
}
void simulate(int N, char ps[6][7], int team, int shiai, int &junni)
{
    char p1[6][7] = { "" };
    char p2[6][7] = { "" };
    memcpy(p1, ps, 6 * 7);
    memcpy(p2, ps, 6 * 7);
    if (ps[team][shiai] == '-')
    {
        p1[team][shiai] = 'o';
        p1[shiai][team] = 'x';
        p2[team][shiai] = 'x';
        p2[shiai][team] = 'o';
    }
    if (shiai == N-1)
    {
        if (team == N-1)
        {
            //順位の判定をする
            int h = hantei(N, p1);
            if (h < junni)
                junni = h;
            h = hantei(N, p2);
            if (h < junni)
                junni = h;
            return;
        }
        shiai = 0;
        team++;
    }
    else
        shiai++;
    simulate(N, p1, team, shiai, junni);
    
    if (ps[team][shiai] == '-')
        simulate(N, p2, team, shiai, junni);
}
int main(int argc, char *argv[])
{
    int N = 0;
    scanf("%d", &N);
    char s[6][7] = { "" };
    int r[6][2] = { 0 }; //勝ち,残り
    for (int i = 0; i < N; i++)
    {
        scanf("%s", s[i]);
    }
/*
    for (int j = 0; j < N; j++)
    {
        if (s[0][j] == '-') //K君未試合分
        {
            s[0][j] = 'o'; //K君が勝ったことにする → だめらしい
            s[j][0] = 'x';
        }
    }
*/
    int junni = 6;
    simulate(N, s, 0, 0, junni);
    printf("%d\n", junni);
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX