Submission #45307

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
45307	2018-04-12T19:40:43 Z	imaxblue	Tales of seafaring (POI13_mor)	C++17	10 / 100	74 ms	8796 KB

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define vi vector<int>
#define vpii vector<pii>
#define vp3i vector<p3i>
#define vpll vector<pll>
#define vp3l vector<p3l>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define PQ priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() ((rand() << 14)+rand())
#define scan(X) do{while((X=getchar())<'0'); for(X-='0'; '0'<=(_=getchar()); X=(X<<3)+(X<<1)+_-'0');}while(0)
char _;
#define pi 3.14159265358979323846
#define short unsigned short
short d[2][1005][1005];
int n, m, q, x, y, w, N, D;
bool T;
vector<short> v[1005];
queue<pair<short, short> > pq;
#define top front
void dijk(int S){
    pq.push(mp(0, S*2));
    while(!pq.empty()){
        D=pq.top().x; T=pq.top().y%2; N=pq.top().y/2; pq.pop();
        if (d[T][S][N]<=D) continue;
        d[T][S][N]=D;
        fox(l, v[N].size()){
            if (d[!T][S][v[N][l]]>D+1)
                pq.push(mp(D+1, v[N][l]*2+!T));
        }
    }
}
int32_t main(){
    memset(d, 0x3f3f, sizeof d);
    scanf("%i%i%i", &n, &m, &q);
    fox(l, m){
        scanf("%i%i", &x, &y);
        v[x].pb(y);
        v[y].pb(x);
    }
    fox1(l, n){
        dijk(l);
    }
    fox(l, q){
        scanf("%i%i%i", &x, &y, &w);
        if (d[w%2][x][y]<=w){
            printf("TAK\n");
        } else {
            printf("NIE\n");
        }
    }
    return 0;
}

Compilation message

mor.cpp: In function 'void dijk(int)':
mor.cpp:23:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define fox(k, x) for (int k=0; k<x; ++k)
mor.cpp:47:13:
         fox(l, v[N].size()){
             ~~~~~~~~~~~~~~        
mor.cpp:47:9: note: in expansion of macro 'fox'
         fox(l, v[N].size()){
         ^~~
mor.cpp: In function 'int32_t main()':
mor.cpp:55:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i%i%i", &n, &m, &q);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
mor.cpp:57:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i", &x, &y);
         ~~~~~^~~~~~~~~~~~~~~~
mor.cpp:65:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i%i", &x, &y, &w);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	4216 KB	Output is correct
2	Incorrect	5 ms	4324 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	4400 KB	Output is correct
2	Correct	5 ms	4436 KB	Output is correct
3	Incorrect	5 ms	4512 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	4512 KB	Output is correct
2	Correct	5 ms	4588 KB	Output is correct
3	Correct	5 ms	4588 KB	Output is correct

Subtask #4
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	4604 KB	Output is correct
2	Incorrect	7 ms	4620 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #5
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	74 ms	4648 KB	Output is correct
2	Incorrect	18 ms	4764 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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