oj.uz

Submission #967680

# Submission time Handle Problem Language Result Execution time Memory
967680 2024-04-22T15:51:50 Z parlimoos Naan (JOI19_naan) C++14
29 / 100
 299 ms 58100 KB 
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define lb lower_bound
#define ub upper_bound
#define arr(x) array<ll , x>
#define endl '\n'

ll n , l;
ll mat[2000][2000];
vector<arr(2)> pts[2000] , o;
vector<int> ord;
bool use[2000];

bool cmpKsr(arr(2) &a , arr(2) &b){
    return ((a[0] * b[1]) < (a[1] * b[0]));
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> l;
    for(int i = 0 ; i < n ; i++){
        for(int j = 0 ; j < l ; j++){
            cin >> mat[i][j];
            mat[i][j] *= n;
        }
    }
    for(int i = 0 ; i < n ; i++){
        ll sm = 0 , now = 0 , tn = 0;
        for(int j = 0 ; j < l ; j++) sm += mat[i][j];
        sm /= n , tn = sm; 
        for(int j = 0 ; j < l ; j++){
            while(now + (mat[i][j]) >= tn){
                arr(2) d = {0 , 0};
                d[0] = (tn - now) , d[1] = mat[i][j];
                ll g = __gcd(d[0] , d[1]);
                d[0] /= g , d[1] /= g;
                d[0] += (1ll * j) * d[1];
                pts[i].pb(d) , tn += sm;
            }
            now += mat[i][j];
        }
    }
    for(int i = 0 ; i < n ; i++){
        if(int(pts[i].size()) != n) exit(0);
    }

    for(int i = 0 ; i < n ; i++){
        arr(2) pt = {-1 , -1};
        int inx = -1;
        for(int j = 0 ; j < n ; j++){
            if(use[j]) continue;
            if(pt[0] == -1 or cmpKsr(pts[j][i] , pt)) pt = pts[j][i] , inx = j;
        }
        o.pb(pt) , use[inx] = 1 , ord.pb(inx);
    }
    for(int i = 1 ; i < n ; i++) cout << o[i - 1][0] << " " << o[i - 1][1] << endl;
    for(int i = 0 ; i < n ; i++) cout << ord[i] + 1 << " ";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 600 KB Output is correct

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 600 KB Output is correct
43 Correct 52 ms 17980 KB Output is correct
44 Incorrect 299 ms 58100 KB X_i is not increasing
45 Halted 0 ms 0 KB -