oj.uz

Submission #123705

# Submission time Handle Problem Language Result Execution time Memory
123705 2019-07-02T05:08:21 Z 윤교준(#3030) Naan (JOI19_naan) C++14
0 / 100
 5 ms 632 KB 
#include <bits/stdc++.h>
#define eb emplace_back
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { for(;b;a%=b,swap(a,b)){} return a; }

struct FRC {
	FRC(ll a, ll b) : a(a), b(b) { norm(); }
	FRC(ll a) : a(a), b(1) {}
	FRC() : a(0), b(1) {}
	ll a, b; // a / b

	void prt() const { printf("%lld %lld\n", a, b); }
	void norm() {
		if(!a) {
			b = 1;
			return;
		}
		if(b < 0) {
			a = -a;
			b = -b;
		}
		ll g = gcd(abs(a), b);
		if(g) {
			a /= g;
			b /= g;
		}
	}

	ll floor() { return a/b; }

	FRC operator + (const FRC &A) const {
		return FRC(a*A.b + b*A.a, b*A.b);
	}
	FRC operator - (const FRC &A) const {
		return FRC(a*A.b - b*A.a, b*A.b);
	}
	FRC operator * (const FRC &A) const {
		return FRC(a*A.a, b*A.b);
	}
	FRC operator / (const FRC &A) const {
		return FRC(a*A.b, b*A.a);
	}

	bool operator == (const FRC &A) const {
		return a == A.a && b == A.b;
	}
	bool operator < (const FRC &A) const {
		return a*A.b < b*A.a;
	}
	bool operator <= (const FRC &A) const {
		return a*A.b <= b*A.a;
	}
	bool operator > (const FRC &A) const {
		return a*A.b > b*A.a;
	}
	bool operator >= (const FRC &A) const {
		return a*A.b >= b*A.a;
	}
};


const int MAXN = 2005;
const int MAXK = 2005;

ll AS[MAXN][MAXK];
int A[MAXN][MAXK];

FRC pos[MAXN];
int O[MAXN];

int N, K;

FRC nxtF(int i, FRC pv, FRC nd) {
	if(nd <= 0) return pv;
	if(pv > K) return K+1;
	int j = pv.floor();
	{
		FRC l = FRC(j+1) - pv;
		if(nd <= l * A[i][j+1])
			return pv + nd / A[i][j+1];
		nd = nd - l * A[i][j+1];
		pv = j+1;
	}
	j++;
	if(nd > AS[i][K]-AS[i][j]) return K+1;
	int s = j, e = N-1; for(int m; s < e;) {
		m = (s+e+1) >> 1;
		if(nd <= AS[i][m]-AS[i][j]) e = m-1;
		else s = m;
	}
	nd = nd - (AS[i][s]-AS[i][j]);
	pv = s;
	return pv + nd / A[i][s+1];
}

bool solve() {
	for(int oi = 1, i, j = 1; oi <= N; oi++) {
		i = O[oi];
		FRC nd(AS[i][K], N);
		pos[oi] = nxtF(i, pos[oi-1], nd);
		if(pos[oi] > K) return false;
	}
	return true;
}

int main() {
	ios::sync_with_stdio(false);

	cin >> N >> K;
	for(int i = 1; i <= N; i++) {
		for(int j = 1; j <= K; j++) {
			cin >> A[i][j];
			AS[i][j] = AS[i][j-1] + A[i][j];
		}
	}

	iota(O, O+N+1, 0);
	do {
		if(!solve()) continue;
		for(int i = 1; i < N; i++) pos[i].prt();
		for(int i = 1; i <= N; i++) printf("%d ", O[i]);
		puts("");
		exit(0);
	} while(next_permutation(O+1, O+N+1));

	return 0;
}

Compilation message

naan.cpp: In function 'bool solve()':
naan.cpp:98:21: warning: unused variable 'j' [-Wunused-variable]
  for(int oi = 1, i, j = 1; oi <= N; oi++) {
                     ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 632 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 508 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Incorrect 5 ms 508 KB Unexpected end of file - int64 expected
19 Halted 0 ms 0 KB -

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -