oj.uz

답안 #312103

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
312103 2020-10-12T11:23:16 Z anakib1 Shortcut (IOI16_shortcut) C++17
0 / 100
 1 ms 256 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);
    }
};
long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c)
{
    ll ans = inf;
    vector<vector<ll> > dd(n, vector<ll>(n));
    rngi(i, n)
        for (int j = i + 1; j < n; j++) dd[i][j] = dd[i][j - 1] + l[j - 1];
    rngi(i, n) rngi(j, i) dd[i][j] = dd[j][i];
    
    rngi(i, n) rngi(j, n) {
        ll dv = 0;
        auto get = [&](int x, int y) {
            ll a = 0;
            if (x >= n) a += d[x - n];
            if (y >= n) a += d[y - n];
            x %= n; y %= n;
            return a + min(dd[x][y], dd[x][i] + c + dd[j][y], dd[x][j] + c + dd[i][y]);
        };
        rngi(x, 2 * n) rngi(y, 2 * n) dv = max(dv, get(x, y)); 
        ans = min(ans, dv);
    }
    return ans;
}

/*
4 10
10 20 20
0 40 0 30
*/

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 1 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Incorrect 1 ms 256 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 1 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Incorrect 1 ms 256 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 1 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Incorrect 1 ms 256 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 1 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Incorrect 1 ms 256 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 1 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Incorrect 1 ms 256 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 1 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Incorrect 1 ms 256 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 1 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Incorrect 1 ms 256 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 1 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Incorrect 1 ms 256 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -