Submission #4339037


Source Code Expand

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;

#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i, x) for (int i = 0; i < x; i++)
#define rep1(i, x) for (int i = 1; i <= x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rrep1(i, x) for (int i = x; i > 0; i--)
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
#define mp1(a, b, c) P1(a, P(b, c))

const int INF = 1000000000;
const ll M = 1000000000;
const int dir_4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int dir_8[8][2] = {{1, 0},  {1, 1},   {0, 1},  {-1, 1},
                         {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};

/*----------------------------------------------/
/- char         : %c  | char *       : %s  | short        : %hd
/- int          : %d  | long         : %ld | long long    : %lld
/- unsigned short:%hu | unsigned int : %u  | unsigned long: %lu
/- u_long long  : %llu| (octal)      : %o  | (hexadecimal): %x
/- float        : %f  | double       : %lf |
/----------------------------------------------*/

/*----------------------------------------------/
/- INT_MAX, LONG_MAX   : 1<<15 = 2.1*pow(10, 9)       (= 2147483647)
/- UINT_MAX, ULONG_MAX : 1<<16 = 4.2*pow(10, 9)       (= 4294967295)
/- LLONG_MAX           : 1<<63 = 9.2*pow(10, 18)      (= 9223372036854775807)
/- ULLONG_MAX          : 1<<64 = 1.8*pow(10, 19)      (= 18446744073709551615)
/----------------------------------------------*/

int n, m;
int x[20], y[20];
int ret = 1;

void dfs(int i, bool b[20]) {
    if (i == m + 1) {
        rep1(j, n) rep1(k, n) {
            if (!b[j])
                break;
            if (!b[k])
                continue;
            if (j == k)
                continue;
            bool b_ = false;
            rep1(l, m) {
                int x0, y0;
                x0 = x[l];
                y0 = y[l];
                if ((j == x0 && k == y0) || (k == x0 && j == y0)) {
                    b_ = true;
                }
            }
            if (!b_)
                return;
        }
        int cnt = 0;
        rep1(j, n) {
            if (b[j])
                cnt++;
        }
        ret = max(ret, cnt);
        return;
    }
    b[i] = false;
    dfs(i + 1, b);
    b[i] = true;
    dfs(i + 1, b);
    return;
}

int main() {
    cin >> n >> m;
    rep1(i, m) scanf("%d%d", &x[i], &y[i]);
    bool b[20];
    rep(i, 20) b[i] = false;
    dfs(1, b);

    cout << ret;
    /* ====================================== */
    cout << endl;
    return 0;
}

Submission Info

Submission Time
Task D - 派閥
User rk222
Language C++ (GCC 5.4.1)
Score 0
Code Size 3080 Byte
Status WA
Exec Time 20 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:96:43: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     rep1(i, m) scanf("%d%d", &x[i], &y[i]);
                                           ^

Judge Result

Set Name all
Score / Max Score 0 / 100
Status
AC × 17
WA × 57
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt, test_59.txt, test_60.txt, test_61.txt, test_62.txt, test_63.txt, test_64.txt, test_65.txt, test_66.txt, test_67.txt, test_68.txt, test_69.txt, test_70.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
test_01.txt AC 1 ms 256 KB
test_02.txt WA 1 ms 256 KB
test_03.txt WA 1 ms 256 KB
test_04.txt AC 1 ms 256 KB
test_05.txt WA 1 ms 256 KB
test_06.txt AC 1 ms 256 KB
test_07.txt AC 1 ms 256 KB
test_08.txt WA 1 ms 256 KB
test_09.txt WA 1 ms 256 KB
test_10.txt WA 1 ms 256 KB
test_11.txt AC 1 ms 256 KB
test_12.txt WA 1 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt WA 1 ms 256 KB
test_15.txt AC 20 ms 256 KB
test_16.txt WA 1 ms 256 KB
test_17.txt WA 1 ms 256 KB
test_18.txt WA 1 ms 256 KB
test_19.txt WA 1 ms 256 KB
test_20.txt WA 1 ms 256 KB
test_21.txt WA 1 ms 256 KB
test_22.txt WA 1 ms 256 KB
test_23.txt WA 1 ms 256 KB
test_24.txt WA 1 ms 256 KB
test_25.txt AC 1 ms 256 KB
test_26.txt WA 1 ms 256 KB
test_27.txt AC 7 ms 256 KB
test_28.txt AC 1 ms 256 KB
test_29.txt WA 1 ms 256 KB
test_30.txt WA 1 ms 256 KB
test_31.txt WA 1 ms 256 KB
test_32.txt WA 1 ms 256 KB
test_33.txt WA 1 ms 256 KB
test_34.txt WA 1 ms 256 KB
test_35.txt WA 1 ms 256 KB
test_36.txt WA 1 ms 256 KB
test_37.txt AC 1 ms 256 KB
test_38.txt WA 1 ms 256 KB
test_39.txt WA 1 ms 256 KB
test_40.txt AC 12 ms 256 KB
test_41.txt WA 1 ms 256 KB
test_42.txt WA 1 ms 256 KB
test_43.txt WA 1 ms 256 KB
test_44.txt WA 1 ms 256 KB
test_45.txt WA 1 ms 256 KB
test_46.txt WA 1 ms 256 KB
test_47.txt WA 1 ms 256 KB
test_48.txt WA 1 ms 256 KB
test_49.txt WA 1 ms 256 KB
test_50.txt WA 1 ms 256 KB
test_51.txt WA 1 ms 256 KB
test_52.txt WA 1 ms 256 KB
test_53.txt WA 1 ms 256 KB
test_54.txt WA 1 ms 256 KB
test_55.txt WA 1 ms 256 KB
test_56.txt WA 1 ms 256 KB
test_57.txt WA 1 ms 256 KB
test_58.txt WA 1 ms 256 KB
test_59.txt WA 1 ms 256 KB
test_60.txt WA 1 ms 256 KB
test_61.txt WA 1 ms 256 KB
test_62.txt AC 1 ms 256 KB
test_63.txt WA 1 ms 256 KB
test_64.txt WA 1 ms 256 KB
test_65.txt WA 1 ms 256 KB
test_66.txt WA 1 ms 256 KB
test_67.txt WA 1 ms 256 KB
test_68.txt WA 1 ms 256 KB
test_69.txt WA 1 ms 256 KB
test_70.txt WA 1 ms 256 KB