oj.uz

답안 #133545

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
133545 2019-07-21T04:31:18 Z tlwpdus Friends (BOI17_friends) C++11
100 / 100
 762 ms 11256 KB 
#include <bits/stdc++.h>

using namespace std;

typedef pair<int,int> pii;

int n, p, q;
vector<int> lis[3000];
int mat[3000][3000];

void pung() {
    puts("detention");
    exit(0);
}

int gn;
vector<int> grp[3000];
int chk[3000], inc[3000];
int sel[3000], cand[3000];
int sb, cb;
bool bt(int nq, int dep) {
    if (sb<=p&&nq<=q) return true;
    if (dep>=p+q||!cb||cb+sb>p+q) return false;
    int v = cand[--cb]; inc[v] = 0; chk[v] = 0;
    if (bt(nq,dep+1)) {
        chk[v] = -1;
        inc[v] = 0;
        return true;
    }
    sel[sb++] = v; chk[v] = 1;
    int psz = cb;
    for (int &there : lis[v]) {
        if (chk[there]==-1&&!inc[there]) {
            cand[cb++] = there; inc[there] = 1;
        }
        nq -= (int)(chk[there]==1)*2-1;
    }
    if (bt(nq,dep+1)) {
        grp[gn].push_back(v);
        chk[v] = -1;
        return true;
    }
    sb--; chk[v] = -1;
    while(cb>psz) inc[cand[--cb]] = 0;
    cand[cb++] = v;
    inc[v] = 1;
    return false;
}

void solve(int a, int b) {
    for (int &v : grp[a]) chk[v]++;
    for (int &v : grp[b]) chk[v]+=2;
    int c[2] = {0,0};
    for (int &v : grp[a]) {
        if (chk[v]!=3) continue;
        for (int &w : lis[v]) {
            if (chk[w]==3||chk[w]==0) continue;
            c[chk[w]-1]++;
        }
    }
    int t = (c[0]<c[1]?a:b);
    for (int i=0;i<grp[t].size();i++) {
        if (chk[grp[t][i]]!=3) continue;
        swap(grp[t][i],grp[t].back());
        grp[t].pop_back(); i--;
    }
    for (int &v : grp[a]) chk[v]=0;
    for (int &v : grp[b]) chk[v]=0;
}

set<pii> se;
int main() {
    scanf("%d%d%d",&n,&p,&q);
    for (int i=0;i<n;i++) {
        int mi;
        scanf("%d",&mi);
        if (mi>=p+q) pung();
        for (int j=0;j<mi;j++) {
            int a;
            scanf("%d",&a);
            mat[i][a] = 1;
            lis[i].push_back(a);
            if (a<=i) {
                if (se.find({a,i})==se.end()) pung();
                se.erase({a,i});
            }
            else se.insert({i,a});
        }
    }
    if (!se.empty()) pung();
    memset(chk,-1,sizeof(chk));
    for (int i=0;i<n;i++) {
        chk[i] = 1;
        for (int j=0;j<n;j++) inc[j] = 0;
        sb = cb = 0; sel[sb++] = i;
        for (int &there : lis[i]) {
            cand[cb++] = there;
            inc[there] = 1;
        }
        if (!bt(lis[i].size(),0)) pung();
        else {
            grp[gn].push_back(i);
            chk[i] = -1;
        }
        gn++;
    }
    memset(chk,0,sizeof(chk));
    for (int i=0;i<n;i++) {
        for (int j=i+1;j<n;j++) {
            solve(i,j);
        }
    }
    puts("home");
    int cnt = 0;
    for (int i=0;i<n;i++) cnt += (grp[i].size()>0);
    printf("%d\n",cnt);
    for (int i=0;i<n;i++) {
        if (grp[i].empty()) continue;
        printf("%d ",grp[i].size());
        for (int &v : grp[i]) printf("%d ",v); printf("\n");
    }

    return 0;
}

Compilation message

friends.cpp: In function 'void solve(int, int)':
friends.cpp:62:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<grp[t].size();i++) {
                  ~^~~~~~~~~~~~~~
friends.cpp: In function 'int main()':
friends.cpp:119:35: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
         printf("%d ",grp[i].size());
                      ~~~~~~~~~~~~~^
friends.cpp:120:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
         for (int &v : grp[i]) printf("%d ",v); printf("\n");
         ^~~
friends.cpp:120:48: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
         for (int &v : grp[i]) printf("%d ",v); printf("\n");
                                                ^~~~~~
friends.cpp:73:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&n,&p,&q);
     ~~~~~^~~~~~~~~~~~~~~~~~~
friends.cpp:76:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&mi);
         ~~~~~^~~~~~~~~~
friends.cpp:80:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d",&a);
             ~~~~~^~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 7 ms 1272 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 3 ms 1528 KB Output is correct
5 Correct 4 ms 1528 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 3 ms 888 KB Output is correct
8 Correct 18 ms 1528 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 7 ms 1272 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 3 ms 1528 KB Output is correct
5 Correct 4 ms 1528 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 3 ms 888 KB Output is correct
8 Correct 18 ms 1528 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 89 ms 4728 KB Output is correct
11 Correct 73 ms 5720 KB Output is correct
12 Correct 94 ms 5496 KB Output is correct
13 Correct 100 ms 5736 KB Output is correct
14 Correct 10 ms 7928 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 504 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 7 ms 1272 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 3 ms 1528 KB Output is correct
13 Correct 4 ms 1528 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 3 ms 888 KB Output is correct
16 Correct 18 ms 1528 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 89 ms 4728 KB Output is correct
19 Correct 73 ms 5720 KB Output is correct
20 Correct 94 ms 5496 KB Output is correct
21 Correct 100 ms 5736 KB Output is correct
22 Correct 10 ms 7928 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 84 ms 8356 KB Output is correct
27 Correct 69 ms 7928 KB Output is correct
28 Correct 87 ms 7416 KB Output is correct
29 Correct 78 ms 4856 KB Output is correct
30 Correct 26 ms 5880 KB Output is correct
31 Correct 10 ms 5880 KB Output is correct
32 Correct 3 ms 504 KB Output is correct
33 Correct 762 ms 11256 KB Output is correct
34 Correct 107 ms 10884 KB Output is correct