oj.uz

답안 #921771

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921771 2024-02-04T09:59:55 Z boris_mihov Naan (JOI19_naan) C++17
29 / 100
 154 ms 11868 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
 
typedef long long llong;
const int MAXN = 2000 + 10;
const int INF = 1e9;
 
int n, l;
struct Fraction
{
    __int128 p;    
    __int128 q;
    Fraction()
    {
        p = 0;
        q = 1;
    }    
 
    Fraction(llong _p, llong _q = 1)
    {
        p = _p;
        q = _q;
        llong g = std::__gcd(p, q);
        p /= g; q /= g;
    }
 
    friend Fraction operator + (const Fraction &left, const Fraction &right)
    {
        return {left.p * right.q + right.p * left.q, left.q * right.q};
    }
 
    friend Fraction operator - (const Fraction &left, const Fraction &right)
    {
        return {left.p * right.q - right.p * left.q, left.q * right.q};
    }
 
    friend Fraction operator * (const Fraction &left, const Fraction &right)
    {
        return {left.p * right.p, left.q * right.q};
    }
 
    friend Fraction operator / (const Fraction &left, const Fraction &right)
    {
        return {left.p * right.q, left.q * right.p};
    }
 
    friend void operator += (Fraction &left, const Fraction &right)
    {
        left = left + right;
    }
 
    friend void operator -= (Fraction &left, const Fraction &right)
    {
        left = left - right;
    }
 
    friend void operator *= (Fraction &left, const Fraction &right)
    {
        left = left * right;
    }
    
    friend void operator /= (Fraction &left, const Fraction &right)
    {
        left = left / right;
    }
 
    friend bool operator < (const Fraction &left, const Fraction &right)
    {
        return (left.p * right.q < right.p * left.q);
    }
 
    friend bool operator <= (const Fraction &left, const Fraction &right)
    {
        return (left.p * right.q <= right.p * left.q);
    }
 
    void print()
    {
        if (std::max(p, q) > 1e9)
        {
            while (std::max(p, q) > 1e9)
            {
                p = p / 2 + (p % 2);
                q = q / 2 + (q % 2);
            }
        }
        std::cout << (llong)p << ' ' << (llong)q << '\n';
    }
};
 
bool taken[MAXN];
Fraction s[MAXN];
llong v[MAXN][MAXN];
Fraction nextSum[MAXN];
Fraction currentSum[MAXN];
std::vector <Fraction> positions;
std::vector <int> order;
 
void solve()
{
    Fraction takenTo = 0;
    for (int pos = 1 ; pos <= l ; ++pos)
    {
        Fraction minimum = l + 1;
        int idx = -1;
 
        for (int i = 1 ; i <= n ; ++i)
        {
            if (taken[i])
            {
                continue;
            }
 
            nextSum[i] = currentSum[i] + (1 - takenTo) * v[i][pos];
            if (s[i] <= nextSum[i])
            {
                Fraction must = pos - 1 + takenTo + (s[i] - currentSum[i]) / v[i][pos];
 
                if (must < minimum)
                {
                    minimum = must;
                    idx = i;
                }
            }
        }
 
        if (idx == -1)
        {
            takenTo = 0;
            for (int i = 1 ; i <= n ; ++i)
            {
                currentSum[i] = nextSum[i];
            }
        } else
        {
            taken[idx] = true;
            order.push_back(idx);
            positions.push_back(minimum);
            takenTo = minimum - pos + 1;
            std::fill(currentSum + 1, currentSum + n + 1, 0);
            pos--;
        }
    }
 
    positions.pop_back();
}
 
void print()
{
    for (int i = 0 ; i < n - 1 ; ++i)
    {
        assert(std::__gcd(positions[i].p, positions[i].q) == 1);
        positions[i].print();
    }
 
    for (int i = 0 ; i < n ; ++i)
    {
        std::cout << order[i] << ' ';
    }
 
    std::cout << '\n';
}
 
void input()
{
    std::cin >> n >> l;
    for (int i = 1 ; i <= n ; ++i)
    {
        for (int j = 1 ; j <= l ; ++j)
        {
            std::cin >> v[i][j];
            s[i] += v[i][j];
        }
        
        s[i] /= n;
    }
}
 
void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}
 
int main()
{
    fastIOI();
    input();
    solve();
    print();
 
    return 0;
}

Compilation message

naan.cpp: In function 'Fraction operator+(const Fraction&, const Fraction&)':
naan.cpp:32:34: warning: narrowing conversion of '((((__int128)left.Fraction::p) * ((__int128)right.Fraction::q)) + (((__int128)right.Fraction::p) * ((__int128)left.Fraction::q)))' from '__int128' to 'llong' {aka 'long long int'} [-Wnarrowing]
   32 |         return {left.p * right.q + right.p * left.q, left.q * right.q};
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
naan.cpp:32:61: warning: narrowing conversion of '(((__int128)left.Fraction::q) * ((__int128)right.Fraction::q))' from '__int128' to 'llong' {aka 'long long int'} [-Wnarrowing]
   32 |         return {left.p * right.q + right.p * left.q, left.q * right.q};
      |                                                      ~~~~~~~^~~~~~~~~
naan.cpp: In function 'Fraction operator-(const Fraction&, const Fraction&)':
naan.cpp:37:34: warning: narrowing conversion of '((((__int128)left.Fraction::p) * ((__int128)right.Fraction::q)) - (((__int128)right.Fraction::p) * ((__int128)left.Fraction::q)))' from '__int128' to 'llong' {aka 'long long int'} [-Wnarrowing]
   37 |         return {left.p * right.q - right.p * left.q, left.q * right.q};
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
naan.cpp:37:61: warning: narrowing conversion of '(((__int128)left.Fraction::q) * ((__int128)right.Fraction::q))' from '__int128' to 'llong' {aka 'long long int'} [-Wnarrowing]
   37 |         return {left.p * right.q - right.p * left.q, left.q * right.q};
      |                                                      ~~~~~~~^~~~~~~~~
naan.cpp: In function 'Fraction operator*(const Fraction&, const Fraction&)':
naan.cpp:42:24: warning: narrowing conversion of '(((__int128)left.Fraction::p) * ((__int128)right.Fraction::p))' from '__int128' to 'llong' {aka 'long long int'} [-Wnarrowing]
   42 |         return {left.p * right.p, left.q * right.q};
      |                 ~~~~~~~^~~~~~~~~
naan.cpp:42:42: warning: narrowing conversion of '(((__int128)left.Fraction::q) * ((__int128)right.Fraction::q))' from '__int128' to 'llong' {aka 'long long int'} [-Wnarrowing]
   42 |         return {left.p * right.p, left.q * right.q};
      |                                   ~~~~~~~^~~~~~~~~
naan.cpp: In function 'Fraction operator/(const Fraction&, const Fraction&)':
naan.cpp:47:24: warning: narrowing conversion of '(((__int128)left.Fraction::p) * ((__int128)right.Fraction::q))' from '__int128' to 'llong' {aka 'long long int'} [-Wnarrowing]
   47 |         return {left.p * right.q, left.q * right.p};
      |                 ~~~~~~~^~~~~~~~~
naan.cpp:47:42: warning: narrowing conversion of '(((__int128)left.Fraction::q) * ((__int128)right.Fraction::p))' from '__int128' to 'llong' {aka 'long long int'} [-Wnarrowing]
   47 |         return {left.p * right.q, left.q * right.p};
      |                                   ~~~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 1 ms 2716 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2700 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2764 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2800 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 2648 KB Output is correct
25 Correct 1 ms 2648 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct

Subtask #3
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 1 ms 2716 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 1 ms 2648 KB Output is correct
27 Correct 1 ms 2700 KB Output is correct
28 Correct 1 ms 2652 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 2 ms 2764 KB Output is correct
32 Correct 2 ms 2652 KB Output is correct
33 Correct 2 ms 2800 KB Output is correct
34 Correct 2 ms 2652 KB Output is correct
35 Correct 2 ms 2652 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 2 ms 2652 KB Output is correct
38 Correct 0 ms 604 KB Output is correct
39 Correct 1 ms 2648 KB Output is correct
40 Correct 1 ms 2648 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 2652 KB Output is correct
43 Incorrect 154 ms 11868 KB X_i is not increasing
44 Halted 0 ms 0 KB -