Submission #260354

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
260354	2020-08-10T06:33:44 Z	최은수(#5043)	Airline Route Map (JOI18_airline)	C++14	22 / 100	1491 ms	1048580 KB

Alice
Bob

#include"Alicelib.h"
#include<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
const int siz=10;
void Alice(int N,int M,int A[],int B[])
{
    int n=N;
    vector<int>vv(n+1);
    for(int i=0,c=0;i<=n;i++)
        vv[i]=c,c+=i*siz+1;
    vector<pi>ed;
    for(int i=0;i<n;i++)
        for(int j=vv[i];j<vv[i+1];j++)
            for(int k=j+1;k<vv[i+1];k++)
                ed.eb(j,k);
    for(int i=0;i<M;i++)
        ed.eb(vv[A[i]],vv[B[i]]);
    InitG(vv[n],(int)ed.size());
    for(int i=0;i<(int)ed.size();i++)
        MakeG(i,ed[i].fi,ed[i].se);
    return;
}

#include"Boblib.h"
#include<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
const int siz=10;
static vector<int>adj[1510];
static bool chk[1510];
static bool ed[1510][1510];
void Bob(int V,int U,int C[],int D[])
{
    int n=0;
    for(int i=0,c=0;i<=siz;c+=i*siz+1,i++)
        if(c==V)
            n=i;
    for(int i=0;i<U;i++)
        adj[C[i]].eb(D[i]),adj[D[i]].eb(C[i]),ed[C[i]][D[i]]=ed[D[i]][C[i]]=1;
    vector<int>vv(n);
    for(int i=0;i<V;i++)
        vv[(int)adj[i].size()/siz]=i;
    for(int i=0;i<V;i++)
        if((int)adj[i].size()%siz!=0)
            vv[(int)adj[i].size()/siz]=i;
    for(int&t:vv)
        chk[t]=1;
    vector<pi>edg;
    for(int i=0;i<n;i++)
        for(int j=i+1;j<n;j++)
            if(ed[vv[i]][vv[j]])
                edg.eb(i,j);
    InitMap(n,(int)edg.size());
    for(pi&t:edg)
        MakeMap(t.fi,t.se);
    return;
}

Subtask #1
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	7448 KB	Output is correct
2	Correct	15 ms	7448 KB	Output is correct
3	Correct	13 ms	7448 KB	Output is correct
4	Correct	14 ms	7448 KB	Output is correct
5	Correct	14 ms	7448 KB	Output is correct
6	Correct	16 ms	7680 KB	Output is correct
7	Correct	15 ms	7448 KB	Output is correct
8	Correct	15 ms	7448 KB	Output is correct
9	Correct	14 ms	7448 KB	Output is correct
10	Correct	13 ms	7440 KB	Output is correct
11	Correct	16 ms	7448 KB	Output is correct
12	Correct	15 ms	7448 KB	Output is correct
13	Correct	14 ms	7448 KB	Output is correct
14	Correct	14 ms	7448 KB	Output is correct
15	Correct	14 ms	7448 KB	Output is correct
16	Correct	14 ms	7448 KB	Output is correct
17	Correct	14 ms	7448 KB	Output is correct
18	Correct	14 ms	7448 KB	Output is correct
19	Correct	14 ms	7448 KB	Output is correct
20	Correct	15 ms	7440 KB	Output is correct
21	Correct	11 ms	7424 KB	Output is correct
22	Correct	9 ms	7168 KB	Output is correct
23	Correct	11 ms	7424 KB	Output is correct
24	Correct	8 ms	7168 KB	Output is correct
25	Correct	7 ms	6912 KB	Output is correct
26	Correct	7 ms	6912 KB	Output is correct
27	Correct	8 ms	7168 KB	Output is correct
28	Correct	12 ms	7424 KB	Output is correct
29	Correct	9 ms	7232 KB	Output is correct
30	Correct	10 ms	7232 KB	Output is correct
31	Correct	13 ms	7440 KB	Output is correct
32	Correct	13 ms	7440 KB	Output is correct
33	Correct	13 ms	7440 KB	Output is correct
34	Correct	16 ms	7440 KB	Output is correct
35	Correct	13 ms	7440 KB	Output is correct
36	Correct	15 ms	7448 KB	Output is correct
37	Correct	17 ms	7448 KB	Output is correct
38	Correct	13 ms	7448 KB	Output is correct
39	Correct	15 ms	7680 KB	Output is correct
40	Correct	14 ms	7448 KB	Output is correct
41	Correct	16 ms	7440 KB	Output is correct
42	Correct	15 ms	7448 KB	Output is correct
43	Correct	13 ms	7448 KB	Output is correct
44	Correct	15 ms	7440 KB	Output is correct
45	Correct	13 ms	7440 KB	Output is correct
46	Correct	14 ms	7448 KB	Output is correct
47	Correct	13 ms	7504 KB	Output is correct
48	Correct	16 ms	7440 KB	Output is correct
49	Correct	14 ms	7632 KB	Output is correct
50	Correct	13 ms	7440 KB	Output is correct
51	Correct	5 ms	6656 KB	Output is correct
52	Correct	5 ms	6912 KB	Output is correct
53	Correct	6 ms	6912 KB	Output is correct
54	Correct	6 ms	6912 KB	Output is correct
55	Correct	5 ms	6912 KB	Output is correct
56	Correct	6 ms	6912 KB	Output is correct
57	Correct	5 ms	6912 KB	Output is correct
58	Correct	6 ms	6912 KB	Output is correct

Subtask #2
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	7448 KB	Output is correct
2	Correct	15 ms	7448 KB	Output is correct
3	Correct	13 ms	7448 KB	Output is correct
4	Correct	14 ms	7448 KB	Output is correct
5	Correct	14 ms	7448 KB	Output is correct
6	Correct	16 ms	7680 KB	Output is correct
7	Correct	15 ms	7448 KB	Output is correct
8	Correct	15 ms	7448 KB	Output is correct
9	Correct	14 ms	7448 KB	Output is correct
10	Correct	13 ms	7440 KB	Output is correct
11	Correct	16 ms	7448 KB	Output is correct
12	Correct	15 ms	7448 KB	Output is correct
13	Correct	14 ms	7448 KB	Output is correct
14	Correct	14 ms	7448 KB	Output is correct
15	Correct	14 ms	7448 KB	Output is correct
16	Correct	14 ms	7448 KB	Output is correct
17	Correct	14 ms	7448 KB	Output is correct
18	Correct	14 ms	7448 KB	Output is correct
19	Correct	14 ms	7448 KB	Output is correct
20	Correct	15 ms	7440 KB	Output is correct
21	Correct	11 ms	7424 KB	Output is correct
22	Correct	9 ms	7168 KB	Output is correct
23	Correct	11 ms	7424 KB	Output is correct
24	Correct	8 ms	7168 KB	Output is correct
25	Correct	7 ms	6912 KB	Output is correct
26	Correct	7 ms	6912 KB	Output is correct
27	Correct	8 ms	7168 KB	Output is correct
28	Correct	12 ms	7424 KB	Output is correct
29	Correct	9 ms	7232 KB	Output is correct
30	Correct	10 ms	7232 KB	Output is correct
31	Correct	13 ms	7440 KB	Output is correct
32	Correct	13 ms	7440 KB	Output is correct
33	Correct	13 ms	7440 KB	Output is correct
34	Correct	16 ms	7440 KB	Output is correct
35	Correct	13 ms	7440 KB	Output is correct
36	Correct	15 ms	7448 KB	Output is correct
37	Correct	17 ms	7448 KB	Output is correct
38	Correct	13 ms	7448 KB	Output is correct
39	Correct	15 ms	7680 KB	Output is correct
40	Correct	14 ms	7448 KB	Output is correct
41	Correct	16 ms	7440 KB	Output is correct
42	Correct	15 ms	7448 KB	Output is correct
43	Correct	13 ms	7448 KB	Output is correct
44	Correct	15 ms	7440 KB	Output is correct
45	Correct	13 ms	7440 KB	Output is correct
46	Correct	14 ms	7448 KB	Output is correct
47	Correct	13 ms	7504 KB	Output is correct
48	Correct	16 ms	7440 KB	Output is correct
49	Correct	14 ms	7632 KB	Output is correct
50	Correct	13 ms	7440 KB	Output is correct
51	Correct	5 ms	6656 KB	Output is correct
52	Correct	5 ms	6912 KB	Output is correct
53	Correct	6 ms	6912 KB	Output is correct
54	Correct	6 ms	6912 KB	Output is correct
55	Correct	5 ms	6912 KB	Output is correct
56	Correct	6 ms	6912 KB	Output is correct
57	Correct	5 ms	6912 KB	Output is correct
58	Correct	6 ms	6912 KB	Output is correct
59	Incorrect	16 ms	11756 KB	Wrong Answer [1]
60	Halted	0 ms	0 KB	-

Subtask #3
0 / 63.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1491 ms	1048580 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Submission #260354

Compilation message

Subtask #1 22.0 / 22.0

Subtask #2 0 / 15.0

Subtask #3 0 / 63.0

Subtask #1
22.0 / 22.0

Subtask #2
0 / 15.0

Subtask #3
0 / 63.0