oj.uz

Submission #962407

# Submission time Handle Problem Language Result Execution time Memory
962407 2024-04-13T13:21:59 Z GrindMachine Ideal city (IOI12_city) C++17
32 / 100
 1000 ms 4700 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<int> dr = {0,1};
vector<int> dc = {1,0};
vector<pll> adj1[N];

int DistanceSum(int n, int *X, int *Y) {
    vector<pll> a(n);
    rep(i,n) a[i] = {X[i],Y[i]};
    sort(all(a));
    
    int ptr = 0;
    rep(i,n){
        auto [r1,c1] = a[i];
        rep(dir,2){
            ll r2 = r1+dr[dir], c2 = c1+dc[dir];
            pll px = {r2,c2};
            if(!binary_search(all(a),px)) conts;
            ll j = lower_bound(all(a),px)-a.begin();
            adj1[i].pb({j,ptr}), adj1[j].pb({i,ptr});
            ptr++;
        }
    }

    vector<bool> vis(n);
    ll ans = 0;

    rep(i,n){
        queue<pll> q;
        fill(all(vis),0);
        q.push({i,0});
        vis[i] = 1;

        while(!q.empty()){
            auto [u,d] = q.front();
            q.pop();

            if(u > i){
                ans += d;
                ans %= MOD;
            }

            for(auto [v,id] : adj1[u]){
                if(vis[v]) conts;
                q.push({v,d+1});
                vis[v] = 1;
            }
        }
    }

    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 2876 KB Output is correct
2 Correct 17 ms 2896 KB Output is correct
3 Correct 39 ms 2908 KB Output is correct
4 Correct 40 ms 2904 KB Output is correct
5 Correct 73 ms 3160 KB Output is correct
6 Correct 70 ms 2988 KB Output is correct
7 Correct 74 ms 2904 KB Output is correct
8 Correct 61 ms 2908 KB Output is correct
9 Correct 64 ms 2984 KB Output is correct
10 Correct 76 ms 2908 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1054 ms 4700 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1050 ms 4444 KB Time limit exceeded
2 Halted 0 ms 0 KB -