Submission #484311

#TimeUsernameProblemLanguageResultExecution timeMemory
484311MohamedFaresNebiliCop and Robber (BOI14_coprobber)C++14
14 / 100
50 ms1688 KiB
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
#include "coprobber.h"
 
        using namespace std;
        using namespace __gnu_pbds;
 
        using ll  = long long;
        using ld  = long double;
        using ii  = pair<ll, ll>;
        using ull = unsigned long long;
 
        using vl  = vector<long long>;
 
        #define mp make_pair
        #define pb push_back
        #define pp pop_back
        #define ff first
        #define ss second
        #define lb lower_bound
        #define ub upper_bound
        #define all(x) (x).begin() , (x).end()
        #define vi vector<int>
 
        const int N = 2*100005;
        const long long MOD = 1000000007;
        const long double EPS = 0.000000001;
        const double PI = 3.14159265358979323846;
        const long long INF = 10000000000000000;
 
        long long gcd(int a, int b) { return (b==0?a:gcd(b, a%b)); }
        long long lcm(int a, int b) { return  a*(b/gcd(a, b)); }
        long long fact(int a) { return (a==1?1:a*fact(a-1)); }
 
        template<class T> using Tree = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
 
        #define MAX_N 500
        vector<int>adj[MAX_N];
 
        int police = 0, r, c;
 
        int start(int N, bool A[MAX_N][MAX_N])
        {
            for(int l = 0; l < N; l++) {
                for(int i=0; i < N; i++) {
                    if(A[l][i]) adj[l].pb(i);
                }
            }
            c = adj[0][1];
            r = N/c;
            return 0;
        }
 
        const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0};
        int dist(int x, int y, int a, int b) { return abs(x-a)+abs(y-b); }
 
        int nextMove(int R)
        {
            int r1 = police / c, r2 = R / c;
            int c1 = police % c, c2 = R % c;
            int a = abs(r1 - r2), b = abs(c1 - c2);
            if(a < b) {
                int curr = 1e9, xx, yy;
                for(int l = 0; l < 2; l++) {
                    int x = r1 + nx[l], y = c1 + ny[l];
                    int d = dist(x, y, r2, c1);
                    if(d < curr) xx = x, yy = y, curr = d;
                }
                return police = xx * c + yy;
            }
            else if(a > b) {
                int curr = 1e9, xx, yy;
                for(int l = 2; l < 4; l++) {
                    int x = r1 + nx[l], y = c1 + ny[l];
                    int d = dist(x, y, r2, c1);
                    if(d < curr) xx = x, yy = y, curr = d;
                }
                return police = xx * c + yy;
            }
            else if(a == b) return police;
        }

Compilation message (stderr)

coprobber.cpp: In function 'int nextMove(int)':
coprobber.cpp:83:9: warning: control reaches end of non-void function [-Wreturn-type]
   83 |         }
      |         ^
coprobber.cpp:71:40: warning: 'yy' may be used uninitialized in this function [-Wmaybe-uninitialized]
   71 |                 return police = xx * c + yy;
      |                                 ~~~~~~~^~~~
coprobber.cpp:71:36: warning: 'xx' may be used uninitialized in this function [-Wmaybe-uninitialized]
   71 |                 return police = xx * c + yy;
      |                                 ~~~^~~
coprobber.cpp:80:40: warning: 'yy' may be used uninitialized in this function [-Wmaybe-uninitialized]
   80 |                 return police = xx * c + yy;
      |                                 ~~~~~~~^~~~
coprobber.cpp:80:36: warning: 'xx' may be used uninitialized in this function [-Wmaybe-uninitialized]
   80 |                 return police = xx * c + yy;
      |                                 ~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...