oj.uz

답안 #970313

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970313 2024-04-26T10:53:03 Z parlimoos Naan (JOI19_naan) C++17
0 / 100
 2 ms 348 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[3000][3000];
vector<arr(2)> pts[3000] , o;
vector<int> ord;
bool use[3000];

bool cmpKsr(arr(2) a , arr(2) b){
    ll g = __gcd(a[0] , b[0]);
    a[0] /= g , b[0] /= g;
    g = __gcd(a[1] , b[1]);
    a[1] /= g , b[1] /= g;
    return ((a[0] * b[1]) < (a[1] * b[0]));
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    freopen("in.txt" , "r" , stdin);

    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 , tn = 0;
        for(int j = 0 ; j < l ; j++) sm += mat[i][j];
        sm /= n , tn = sm; 
        for(ll j = 0 ; j < l ; j++){
            while(mat[i][j] >= tn){
                arr(2) d = {tn , mat[i][j]};
                ll g = __gcd(d[0] , d[1]);
                d[0] /= g , d[1] /= g;
                d[0] += j * d[1];
                pts[i].pb(d);
                tn += sm;
            }
            tn -= mat[i][j];
        }
    }

    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 - 1 ; i++){
    //     if(!cmpKsr(o[i - 1] , o[i])){
    //         cout << o[i][0] << " " << o[i][1] << ":\n";
    //         cout << o[i - 1][0] << " " << o[i - 1][1] << "::\n";
    //         exit(0);
    //     }
    // }
    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 << " ";
}

Compilation message

naan.cpp: In function 'int main()':
naan.cpp:33:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     freopen("in.txt" , "r" , stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 348 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 348 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 348 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -