답안 #447934

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
447934	2021-07-28T08:20:41 Z	idas	Political Development (BOI17_politicaldevelopment)	C++11	4 / 100	1 ms	460 KB

politicaldevelopment

#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i = (begin); i < (end); i++)
#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr)
#define F first
#define S second
#define PB push_back
#define sz(x) ((int)((x).size()))
#define le(vec) vec[vec.size()-1]
#define TSTS int t; cin >> t; while(t--)solve()

const int INF = 1e9;
const long long LINF = 1e18;
const long double PI = asin(1)*2;
const int MOD = 1e9+7;

using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef map<int, int> mii;
typedef long long ll;
typedef long double ld;

void setIO()
{
    FAST_IO;
}

int main()
{
    setIO();
    int n, k;
    cin >> n >> k;
    int ans=1;
    map<pii, int> cnt;
    FOR(i, 0, n)
    {
        int m;
        cin >> m;
        FOR(j, 0, m)
        {
            int x;
            cin >> x;
            int b=++cnt[{min(i, x), max(i, x)}];
            if(b>=2){
                cout << 2;
                return 0;
            }
        }
    }
    cout << ans;
}

Subtask #1

4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	1 ms	460 KB	Output is correct
5	Correct	1 ms	452 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct

Subtask #2

0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	1 ms	460 KB	Output is correct
5	Correct	1 ms	452 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	460 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	452 KB	Output is correct
15	Incorrect	1 ms	204 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #3

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Incorrect	1 ms	312 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #4

0 / 38.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	1 ms	460 KB	Output is correct
5	Correct	1 ms	452 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	460 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	452 KB	Output is correct
15	Incorrect	1 ms	204 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	1 ms	460 KB	Output is correct
5	Correct	1 ms	452 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	460 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	452 KB	Output is correct
15	Incorrect	1 ms	204 KB	Output isn't correct
16	Halted	0 ms	0 KB	-