제출 #278813

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
278813		caoash	Naan (JOI19_naan)	C++14	5 / 100	76 ms	126456 KiB

naan

#include <bits/stdc++.h> 
using namespace std;
 
using ll = long long;
 
using vi = vector<int>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
 
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
 
struct fr{
    __int128 x, y;
    
    fr(__int128 X = 0, __int128 Y = 1){
        x = X, y = Y;
        ll g = __gcd(x, y);
        x /= g, y /= g;
    }
    
    friend fr operator+(fr a, fr b){
        return fr(a.x * b.y + b.x * a.y, a.y * b.y);
    }
    
    friend fr operator-(fr a, fr b){
        return fr(a.x * b.y - b.x * a.y, a.y * b.y);
    }
    
    friend fr operator*(fr a, fr b){
        return fr(a.x * b.x, a.y * b.y);
    }
    
    friend fr operator/(fr a, fr b){
        return fr(a.x * b.y, a.y * b.x);
    }
    
    friend bool operator<(fr a, fr b){
        return a.x * b.y < b.x * a.y;
    }
};
 
const int MX = 2005;
 
bool used[MX]; fr V[MX][MX]; fr need[MX], dist[MX], ans[MX]; int ind[MX];
 
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, L; cin >> N >> L;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < L; j++) {
            ll x; cin >> x; 
            V[i][j] = fr(x);
            if (j != 0) V[i][j] = V[i][j] + V[i][j - 1];
        }
    }
    for (int i = 0; i < N; i++) {
        ans[i] = fr(L + 1);
        for (int j = 0; j < N; j++) {
            if (used[j]) {
                continue;
            }
            fr need = (i == 0 ? ind[i - 1] : fr(0)) + V[j][L - 1] * fr(1, N);
            // cout << "i, need: " << i << " " << (ll) need.x << " " << (ll) need.y << '\n';
            int it = upper_bound(V[j], V[j] + L - 1, need) - V[j] - 1;
            // cout << i << " " << it << endl;
            fr to_add = fr(it + 1) + (need - V[j][it]) / (V[j][it + 1] - V[j][it]);
            if (to_add < ans[i]) {
                ans[i] = to_add;
                ind[i] = j;
            }
        }
        if(i < N - 1) cout << (ll) ans[i].x << " " << (ll) ans[i].y << '\n';
        used[ind[i]] = true;
    }
    for (int i = 0; i < N; i++) {
        cout << ind[i] + 1 << " ";
    }
    cout << '\n';
}

컴파일 시 표준 에러 (stderr) 메시지

naan.cpp: In function 'int main()':
naan.cpp:68:42: warning: array subscript -1 is below array bounds of 'int [2005]' [-Warray-bounds]
   68 |             fr need = (i == 0 ? ind[i - 1] : fr(0)) + V[j][L - 1] * fr(1, N);
      |                                 ~~~~~~~~~^
naan.cpp:49:66: note: while referencing 'ind'
   49 | bool used[MX]; fr V[MX][MX]; fr need[MX], dist[MX], ans[MX]; int ind[MX];
      |                                                                  ^~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 24
• Subtask 3: 0 / 71