oj.uz

Submission #311083

# Submission time Handle Problem Language Result Execution time Memory
311083 2020-10-09T08:37:04 Z anakib1 Towns (IOI15_towns) C++17
25 / 100
 27 ms 896 KB 
//나는 가상 소녀들에게 큰 호감이 있습니다.

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define problem "a"

template<typename A, typename B, typename C>
struct triple {
    A X;
    B Y;
    C Z;
    triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
    return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
    if (a.X != b.X)
        return a.X < b.X;
    if (a.Y != b.Y)
        return a.Y < b.Y;
    return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
    ofs << "( " << p.F << " , " << p.S << " )";
    return ofs;
}
template<typename T>
void print(T a) {
    for (auto i : a)
        cout << i << ' ';
    cout << '\n';
}
template<typename T>
T max(T a, T b, T c) {
    return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c) {
    return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a) {
    return *min_element(all(a));
}
template<typename T, typename D>
D max(T a) {
    return *max_element(all(a));
}
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
//int getDistance(int x, int y) { return 1; }
#include "towns.h"
int hubDistance(int n, int sub) {
    vi d1(n), d2(n);
    rngi(i, n) d1[i] = getDistance(i, 0);
    int f = max_element(all(d1)) - d1.begin();
    rngi(i, n) d2[i] = getDistance(f, i);
    int s = max_element(all(d2)) - d2.begin();
    int r = 1e9;
    rngi(i, n) {
        int t = d1[i] + d2[i] - d2[0] >> 1; t = d2[i] - t;
        r = min(r, max(t, d2[s] - t));
    }
    return r;
}

void solve() {

};
/*
signed main()
{
    if (1) {
        freopen(problem".in", "r", stdin);
        freopen(problem".out", "w", stdout);
    }
    srand(time(NULL));
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(false);
    int t = 1;// cin >> t;
    rng(t) solve();
}
*/

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:117:34: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
  117 |     int f = max_element(all(d1)) - d1.begin();
      |             ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
towns.cpp:119:34: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
  119 |     int s = max_element(all(d2)) - d2.begin();
      |             ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
towns.cpp:122:31: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
  122 |         int t = d1[i] + d2[i] - d2[0] >> 1; t = d2[i] - t;
towns.cpp:114:28: warning: unused parameter 'sub' [-Wunused-parameter]
  114 | int hubDistance(int n, int sub) {
      |                        ~~~~^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 384 KB Output is correct
2 Correct 19 ms 896 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 22 ms 896 KB Output is correct
5 Correct 22 ms 896 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 384 KB Output is correct
2 Correct 17 ms 768 KB Output is correct
3 Correct 27 ms 896 KB Output is correct
4 Correct 23 ms 896 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 384 KB Output isn't correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -