Submission #83013

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
83013	2018-11-03 21:32:21	Bodo171	Soccer (JOI17_soccer)	C++14	100 / 100	378 ms	23252 KiB

soccer

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
const int nmax=505;
const long long lim=1LL*1e18;
int d1[]={-1,0,1,0};
int d2[]={0,-1,0,1};
struct node
{
    long long dd;
    int l,c,st;
};
struct cmp
{
    bool operator()(node unu,node doi)
    {
        return unu.dd>doi.dd;
    }
};
priority_queue< node,vector<node>,cmp> pq;
long long d[nmax][nmax][5];
long long D[nmax][nmax];
bool ok[nmax][nmax];
int n,m,li,ci,si,l1,l2,c1,c2,dir,nr,i,x,y,j,s;
long long di,A,B,C,ans;
void prp(int lf,int cf,int sf,long long df)
{
    if(lf<=0||cf<=0||lf>n||cf>m) return;
    if(df<d[lf][cf][sf])
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 30 / 30
• Subtask 3: 65 / 65