oj.uz

답안 #201387

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201387 2020-02-10T10:49:29 Z BThero Naan (JOI19_naan) C++17
100 / 100
 787 ms 96248 KB 
// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()
                                                  
#include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
 
#define pb push_back
#define mp make_pair
 
#define all(x) (x).begin(), (x).end()
 
#define fi first
#define se second
 
using namespace std;
//using namespace __gnu_pbds;
 
typedef long long ll;   
typedef pair<int, int> pii;
//template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
const int MAXN = (int)2e3 + 5;
 
struct Ratio {
    ll a, b;
 
    Ratio() {
        a = 0;
        b = 1;
    }
 
    Ratio(ll a, ll b) : a(a), b(b) {}             
};         
 
bool operator < (Ratio f, Ratio s) {
    return (double)f.a / f.b < (double)s.a / s.b;
}
 
vector<Ratio> V[MAXN];
 
ll arr[MAXN][MAXN];
 
bool used[MAXN];
 
int ptr[MAXN];
 
int n, m;
 
void solve() {
    scanf("%d %d", &n, &m);
 
    for (int i = 1; i <= n; ++i) {
        ll mean = 0, cur = 0;
 
        for (int j = 1; j <= m; ++j) {
            scanf("%lld", &arr[i][j]);
            mean += arr[i][j];
            arr[i][j] *= n;
        }
 
        ll pref = 0;
 
        for (int j = 1; j <= m; ++j) {
            ll Y = 0, X = arr[i][j];
 
            while (Y < X) {
                if (cur + (X - Y) > mean) {
                    Y += (mean - cur);
                    cur = mean;                                                                                                                                                                                           
                }
                else {
                    cur += (X - Y);
                    Y = X;        
                }
 
                if (cur == mean) {
                    V[i].pb(Ratio((j - 1) * X + Y, X));
                    cur = 0;
                }
            }
 
            pref += X;      
        }
 
        assert(V[i].size() == n);                        
    }
 
    vector<int> perm;
    
    for (int j = 0; j < n; ++j) {
        int best = -1;                
        
        for (int i = 1; i <= n; ++i) {
            if (!used[i]) {
                if (best == -1 || V[i][j] < V[best][j]) {
                    best = i;
                }                        
            }
        }
 
        assert(best != -1);
        used[best] = 1;
 
        if (j + 1 < n) {
            printf("%lld %lld\n", V[best][j].a, V[best][j].b);
        }
 
        perm.pb(best);
    }
 
    for (int x : perm) {
        printf("%d ", x);
    }
}
 
int main() {
    int tt = 1;
 
    while (tt--) {
        solve();
    }
 
    return 0;
}

Compilation message

In file included from /usr/include/c++/7/cassert:44:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:33,
                 from naan.cpp:4:
naan.cpp: In function 'void solve()':
naan.cpp:86:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         assert(V[i].size() == n);                        
                ~~~~~~~~~~~~^~~~
naan.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
naan.cpp:57:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%lld", &arr[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 6 ms 504 KB Output is correct
19 Correct 6 ms 504 KB Output is correct
20 Correct 5 ms 504 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 6 ms 504 KB Output is correct
25 Correct 6 ms 504 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 6 ms 504 KB Output is correct
30 Correct 6 ms 504 KB Output is correct
31 Correct 6 ms 504 KB Output is correct
32 Correct 6 ms 504 KB Output is correct
33 Correct 6 ms 504 KB Output is correct
34 Correct 6 ms 504 KB Output is correct
35 Correct 6 ms 504 KB Output is correct
36 Correct 6 ms 504 KB Output is correct
37 Correct 6 ms 504 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 6 ms 504 KB Output is correct
40 Correct 6 ms 376 KB Output is correct
41 Correct 5 ms 376 KB Output is correct
42 Correct 6 ms 376 KB Output is correct
43 Correct 68 ms 11864 KB Output is correct
44 Correct 336 ms 54140 KB Output is correct
45 Correct 229 ms 21496 KB Output is correct
46 Correct 37 ms 2424 KB Output is correct
47 Correct 257 ms 31100 KB Output is correct
48 Correct 210 ms 74744 KB Output is correct
49 Correct 87 ms 21752 KB Output is correct
50 Correct 400 ms 91512 KB Output is correct
51 Correct 224 ms 38012 KB Output is correct
52 Correct 444 ms 80028 KB Output is correct
53 Correct 344 ms 76152 KB Output is correct
54 Correct 6 ms 376 KB Output is correct
55 Correct 88 ms 44024 KB Output is correct
56 Correct 296 ms 52088 KB Output is correct
57 Correct 237 ms 46040 KB Output is correct
58 Correct 322 ms 75000 KB Output is correct
59 Correct 271 ms 42076 KB Output is correct
60 Correct 761 ms 96120 KB Output is correct
61 Correct 674 ms 95864 KB Output is correct
62 Correct 761 ms 95864 KB Output is correct
63 Correct 759 ms 95992 KB Output is correct
64 Correct 787 ms 96204 KB Output is correct
65 Correct 597 ms 96052 KB Output is correct
66 Correct 616 ms 95992 KB Output is correct
67 Correct 575 ms 96248 KB Output is correct
68 Correct 279 ms 54524 KB Output is correct
69 Correct 337 ms 48888 KB Output is correct
70 Correct 313 ms 65784 KB Output is correct
71 Correct 508 ms 71160 KB Output is correct