oj.uz

답안 #411631

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
411631 2021-05-25T16:14:12 Z wiwiho Naan (JOI19_naan) C++14
100 / 100
 513 ms 116564 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
//    return o << (ld) p.F / p.S;
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

bool compfrac(pll a, pll b){
    return (__int128)a.F * b.S < (__int128)a.S * b.F;
}

int main(){
    StarBurstStream

//    mt19937 rnd(123123);
//    uniform_int_distribution<int> ud(1, 100000);

    int n, l;
    cin >> n >> l;
//    n = l = 2000;

    vector<vector<ll>> v(n + 1, vector<ll>(l + 1));
    vector<vector<pll>> c(n + 1, vector<pll>(n + 1));

    for(int i = 1; i <= n; i++){
        ll sum = 0;
        for(int j = 1; j <= l; j++){
            cin >> v[i][j];
//            v[i][j] = ud(rnd);
            v[i][j] *= n;
            sum += v[i][j];
        }
        sum /= n;

        ll p = 1, r = v[i][1];
        for(int j = 1; j <= n; j++){
            while(r < sum){
                p++;
                r += v[i][p];
            }
            r -= sum;
            c[i][j] = mp(p * v[i][p] - r, v[i][p]);
        }

//        printv(c[i], cerr);

    }

    vector<pll> ans(n + 1);
    vector<ll> ap(n + 1);
    vector<bool> ok(n + 1);
    for(int i = 1; i <= n; i++){
        pll mn = mp(l + 1, 1);
        int mnp = -1;
        for(int j = 1; j <= n; j++){
            if(ok[j]) continue;
            if(compfrac(c[j][i], mn)){
                mn = c[j][i];
                mnp = j;
            }
        }
        ans[i] = mn;
        ap[i] = mnp;
        ok[mnp] = true;
    }

    for(int i = 1; i < n; i++){
        cout << ans[i].F << " " << ans[i].S << "\n";
    }
    for(int i = 1; i <= n; i++){
        cout << ap[i] << " ";
    }
    cout << "\n";

    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct

Subtask #3
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 2 ms 332 KB Output is correct
37 Correct 2 ms 332 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 2 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 35 ms 7400 KB Output is correct
44 Correct 205 ms 43148 KB Output is correct
45 Correct 140 ms 25284 KB Output is correct
46 Correct 25 ms 3148 KB Output is correct
47 Correct 161 ms 34640 KB Output is correct
48 Correct 124 ms 64184 KB Output is correct
49 Correct 51 ms 17092 KB Output is correct
50 Correct 262 ms 86832 KB Output is correct
51 Correct 149 ms 34756 KB Output is correct
52 Correct 294 ms 78960 KB Output is correct
53 Correct 226 ms 67572 KB Output is correct
54 Correct 2 ms 332 KB Output is correct
55 Correct 43 ms 32836 KB Output is correct
56 Correct 189 ms 48036 KB Output is correct
57 Correct 163 ms 39744 KB Output is correct
58 Correct 198 ms 65120 KB Output is correct
59 Correct 176 ms 40692 KB Output is correct
60 Correct 509 ms 116292 KB Output is correct
61 Correct 466 ms 116228 KB Output is correct
62 Correct 473 ms 115884 KB Output is correct
63 Correct 513 ms 116564 KB Output is correct
64 Correct 493 ms 116380 KB Output is correct
65 Correct 376 ms 102992 KB Output is correct
66 Correct 370 ms 103236 KB Output is correct
67 Correct 385 ms 103076 KB Output is correct
68 Correct 177 ms 49220 KB Output is correct
69 Correct 208 ms 49064 KB Output is correct
70 Correct 195 ms 59588 KB Output is correct
71 Correct 300 ms 75084 KB Output is correct