oj.uz

답안 #337392

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
337392 2020-12-20T14:24:48 Z ryangohca Naan (JOI19_naan) C++17
29 / 100
 195 ms 68844 KB 
#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
using namespace std;
struct fraction{
    int num, den;
    fraction(int num=0, int den=1):num(num), den(den){}
 
    void normalize(){
        int g = __gcd(num, den);
        num /= g;
        den /= g;
        if(den < 0){
            num = -num;
            den = -den;
        }
    }
 
    fraction operator-(){
        return fraction{-num, den};
    }
 
    fraction operator+=(const fraction &b){
        num = num*b.den + den*b.num;
        den = den*b.den;
        normalize();
        return *this;
    }
    fraction operator-=(const fraction &b){
        num = num*b.den - den*b.num;
        den = den*b.den;
        normalize();
        return *this;
    }
    fraction operator*=(const fraction &b){
        num = num*b.num;
        den = den*b.den;
        normalize();
        return *this;
    }
    fraction operator/=(const fraction &b){
        num = num*b.den;
        den = den*b.num;
        normalize();
        return *this;
    }
};
 
fraction operator+(fraction a, const fraction &b){return (a += b);}
fraction operator-(fraction a, const fraction &b){return (a -= b);}
fraction operator*(fraction a, const fraction &b){return (a *= b);}
fraction operator/(fraction a, const fraction &b){return (a /= b);}
bool operator==(const fraction &a, const fraction &b){return 1.0*a.num*b.den == 1.0*a.den*b.num;}
bool operator<(const fraction &a, const fraction &b){return 1.0*a.num*b.den < 1.0*a.den*b.num;}
bool operator>(const fraction &a, const fraction &b){return 1.0*a.num*b.den > 1.0*a.den*b.num;}
bool operator<=(const fraction &a, const fraction &b){return 1.0*a.num*b.den <= 1.0*a.den*b.num;}
bool operator>=(const fraction &a, const fraction &b){return 1.0*a.num*b.den >= 1.0*a.den*b.num;}

int nums[2000][2000];
fraction cuts[2000][2000];
vector<fraction> confirmed;
vector<int> order;
bool ordered[2000];
inline int read() {
    int x = 0;
    char ch = getchar_unlocked();
    while (ch < '0' || ch > '9') ch = getchar_unlocked();
    while (ch >= '0' && ch <= '9') {
		x = (x << 3) + (x << 1) + (ch & 15);
		ch = getchar_unlocked();
	}
	return x;
}
main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n = read(), l = read();
    fraction zero = fraction(0, 1), one = fraction(1, 1);
    for (int i = 0; i < n; i++){
        fraction need;
        for (int j = 0; j < l; j++) {
            nums[i][j] = read();
            need += fraction(nums[i][j], 1);
        }
        need /= fraction(n, 1);
        fraction curr, prevleft;
        int idx = 0;
        for (int j = 1; j < n; j++){
            while (need > curr){
                fraction willtake = (one - prevleft) * fraction(nums[i][idx], 1);
                if (curr + willtake <= need){
                    curr += willtake;
                    idx++;
                    prevleft = zero;
                } else {
                    prevleft = (need - curr) / fraction(nums[i][idx], 1);
                    curr = need;
                    break;
                }
            }
            cuts[i][j] = fraction(idx, 1) + prevleft;
            curr = fraction(0, 1);
        }
    }
    for (int i = 1; i < n; i++){ // cut i
        pair<fraction, int> giveCut = {fraction(1e9, 1), -1};
        for (int j = 0; j < n; j++){ // person j
            if (!ordered[j]) {
                pair<fraction, int> other = {cuts[j][i], j};
                giveCut = min(giveCut, other);
            }
        }
        ordered[giveCut.second] = true;
        confirmed.push_back(giveCut.first);
        order.push_back(giveCut.second);
    }
    for (int i = 0; i < n; i++){
        if (!ordered[i]) order.push_back(i);
    }
    for (fraction i : confirmed){
        cout << i.num << ' ' << i.den << '\n';
    }
    for (auto i : order) cout << i + 1 << ' ';
    cout << '\n';
}

Compilation message

naan.cpp:74:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   74 | main(){
      |      ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 62956 KB Output is correct
2 Correct 34 ms 62956 KB Output is correct
3 Correct 33 ms 62976 KB Output is correct
4 Correct 33 ms 63096 KB Output is correct
5 Correct 33 ms 63024 KB Output is correct
6 Correct 33 ms 62956 KB Output is correct
7 Correct 34 ms 62956 KB Output is correct
8 Correct 33 ms 62956 KB Output is correct
9 Correct 33 ms 62976 KB Output is correct
10 Correct 33 ms 62956 KB Output is correct
11 Correct 34 ms 62956 KB Output is correct
12 Correct 33 ms 62956 KB Output is correct
13 Correct 35 ms 63084 KB Output is correct
14 Correct 34 ms 62956 KB Output is correct
15 Correct 34 ms 62976 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 62956 KB Output is correct
2 Correct 34 ms 63084 KB Output is correct
3 Correct 34 ms 63084 KB Output is correct
4 Correct 34 ms 63084 KB Output is correct
5 Correct 34 ms 63104 KB Output is correct
6 Correct 33 ms 63084 KB Output is correct
7 Correct 33 ms 62956 KB Output is correct
8 Correct 33 ms 62956 KB Output is correct
9 Correct 34 ms 63084 KB Output is correct
10 Correct 34 ms 63084 KB Output is correct
11 Correct 33 ms 63084 KB Output is correct
12 Correct 34 ms 63084 KB Output is correct
13 Correct 34 ms 63084 KB Output is correct
14 Correct 34 ms 63084 KB Output is correct
15 Correct 34 ms 63084 KB Output is correct
16 Correct 34 ms 63104 KB Output is correct
17 Correct 34 ms 63084 KB Output is correct
18 Correct 35 ms 63104 KB Output is correct
19 Correct 34 ms 63084 KB Output is correct
20 Correct 36 ms 63084 KB Output is correct
21 Correct 34 ms 63084 KB Output is correct
22 Correct 34 ms 63048 KB Output is correct
23 Correct 37 ms 62956 KB Output is correct
24 Correct 36 ms 63084 KB Output is correct
25 Correct 37 ms 63084 KB Output is correct
26 Correct 33 ms 62988 KB Output is correct
27 Correct 37 ms 63084 KB Output is correct

Subtask #3
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 62956 KB Output is correct
2 Correct 34 ms 62956 KB Output is correct
3 Correct 33 ms 62976 KB Output is correct
4 Correct 33 ms 63096 KB Output is correct
5 Correct 33 ms 63024 KB Output is correct
6 Correct 33 ms 62956 KB Output is correct
7 Correct 34 ms 62956 KB Output is correct
8 Correct 33 ms 62956 KB Output is correct
9 Correct 33 ms 62976 KB Output is correct
10 Correct 33 ms 62956 KB Output is correct
11 Correct 34 ms 62956 KB Output is correct
12 Correct 33 ms 62956 KB Output is correct
13 Correct 35 ms 63084 KB Output is correct
14 Correct 34 ms 62956 KB Output is correct
15 Correct 34 ms 62976 KB Output is correct
16 Correct 33 ms 62956 KB Output is correct
17 Correct 34 ms 63084 KB Output is correct
18 Correct 34 ms 63084 KB Output is correct
19 Correct 34 ms 63084 KB Output is correct
20 Correct 34 ms 63104 KB Output is correct
21 Correct 33 ms 63084 KB Output is correct
22 Correct 33 ms 62956 KB Output is correct
23 Correct 33 ms 62956 KB Output is correct
24 Correct 34 ms 63084 KB Output is correct
25 Correct 34 ms 63084 KB Output is correct
26 Correct 33 ms 63084 KB Output is correct
27 Correct 34 ms 63084 KB Output is correct
28 Correct 34 ms 63084 KB Output is correct
29 Correct 34 ms 63084 KB Output is correct
30 Correct 34 ms 63084 KB Output is correct
31 Correct 34 ms 63104 KB Output is correct
32 Correct 34 ms 63084 KB Output is correct
33 Correct 35 ms 63104 KB Output is correct
34 Correct 34 ms 63084 KB Output is correct
35 Correct 36 ms 63084 KB Output is correct
36 Correct 34 ms 63084 KB Output is correct
37 Correct 34 ms 63048 KB Output is correct
38 Correct 37 ms 62956 KB Output is correct
39 Correct 36 ms 63084 KB Output is correct
40 Correct 37 ms 63084 KB Output is correct
41 Correct 33 ms 62988 KB Output is correct
42 Correct 37 ms 63084 KB Output is correct
43 Incorrect 195 ms 68844 KB Not a fair distribution.
44 Halted 0 ms 0 KB -