oj.uz

Submission #260353

# Submission time Handle Problem Language Result Execution time Memory
260353 2020-08-10T06:32:17 Z 최은수(#5043) Airline Route Map (JOI18_airline) C++14
0 / 100
 1425 ms 1048580 KB 
#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=5;
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=5;
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
0 / 22.0

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

Subtask #2
0 / 15.0

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

Subtask #3
0 / 63.0

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