Submission #595735

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
595735	2022-07-14T04:56:14 Z	반딧불(#8442)	IOI Fever (JOI21_fever)	C++17	0 / 100	6 ms	784 KB

fever

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int xx[4] = {0, 1, 0, -1}, yy[]={1, 0, -1, 0};

int n;
int x[10], y[10];
int dir[10];
int ans;
bool taken[10];

struct dat{
    int x, y, t;
    dat(){}
    dat(int x, int y, int t): x(x), y(y), t(t){}
    bool operator<(const dat &r)const{
        return t>r.t;
    }
};

int solve(){
    for(int i=1; i<=n; i++){
        taken[i] = (i==1);
    }
    priority_queue<dat> pq;
    for(int i=1; i<=n; i++){
        for(int j=i+1; j<=n; j++){
            if(dir[i]%2 == dir[j]%2) continue;
            int a = i, b = j;
            if(dir[a]%2 == 0) swap(a, b); /// a:Ȧ, b:¦
            if(dir[a] == 1){
                if(dir[b]==2 && x[a]-y[a]==x[b]-y[b]) pq.push(dat(a, b, x[b]-x[a]));
                if(dir[b]==0 && x[a]+y[a]==x[b]+y[b]) pq.push(dat(a, b, x[b]-x[a]));
            }
            if(dir[a] == 3){
                if(dir[b]==0 && x[a]-y[a]==x[b]-y[b]) pq.push(dat(a, b, x[a]-x[b]));
                if(dir[b]==2 && x[a]+y[a]==x[b]+y[b]) pq.push(dat(a, b, x[a]-x[b]));
            }
        }
    }
    while(!pq.empty()){
        dat tmp = pq.top(); pq.pop();
        if(taken[tmp.y]) swap(tmp.x, tmp.y);
        if(taken[tmp.x]) taken[tmp.y] = 1;
    }
    return count(taken+1, taken+n+1, true);
}

void dfs(int x){
    if(x==n+1){
        ans = max(ans, solve());
        return;
    }
    for(int i=0; i<4; i++){
        dir[x] = i;
        dfs(x+1);
    }
}

int main(){
    scanf("%d", &n);
    for(int i=1; i<=n; i++){
        scanf("%d %d", &x[i], &y[i]);
    }
    dfs(1);
    printf("%d", ans);
}

Compilation message

fever.cpp: In function 'int main()':
fever.cpp:64:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
fever.cpp:66:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |         scanf("%d %d", &x[i], &y[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	224 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	296 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Incorrect	6 ms	300 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #2
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	224 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	296 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Incorrect	6 ms	300 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #3
0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	2 ms	784 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	224 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	296 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Incorrect	6 ms	300 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #5
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	224 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	296 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Incorrect	6 ms	300 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #6
0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	224 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	296 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Incorrect	6 ms	300 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #7
0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	224 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	296 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Incorrect	6 ms	300 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Submission #595735

Compilation message

Subtask #1 0 / 5.0

Subtask #2 0 / 8.0

Subtask #3 0 / 6.0

Subtask #4 0 / 6.0

Subtask #5 0 / 12.0

Subtask #6 0 / 32.0

Subtask #7 0 / 31.0

Subtask #1
0 / 5.0

Subtask #2
0 / 8.0

Subtask #3
0 / 6.0

Subtask #4
0 / 6.0

Subtask #5
0 / 12.0

Subtask #6
0 / 32.0

Subtask #7
0 / 31.0