| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 524376 |
2022-02-09T06:51:28 Z |
fatemetmhr |
Naan (JOI19_naan) |
C++17 |
|
117 ms |
18092 KB |
// ~Be name khoda~ //
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define cl clear
#define endll '\n'
const int maxn = 1e6 + 10;
const int maxn5 = 2e3 + 10;
const int maxnt = 1.2e6 + 10;
const int maxn3 = 1e3 + 10;
const int mod = 1e9 + 7;
const ll inf = 2e18;
struct kasr{
ll s, m;
kasr(ll a, ll b){
ll g = __gcd(a, b);
s = a / g;
m = b / g;
}
kasr(){
s = 0;
m = 1;
}
inline ll ciel(){
ll f = s / m;
if(s * f != m)
f++;
return f;
}
};
inline kasr operator -(ll a, kasr b){
a *= b.m;
return kasr(a - b.s, b.m);
}
inline kasr operator -(kasr a, kasr b){
ll mm = a.m * b.m / __gcd(a.m, b.m);
return kasr(a.s * (mm / a.m) - b.s * (mm / b.m), mm);
}
inline kasr operator +(kasr a, kasr b){
ll mm = a.m * b.m / __gcd(a.m, b.m);
return kasr(a.s * (mm / a.m) + b.s * (mm / b.m), mm);
}
inline bool operator <=(kasr a, kasr b){
return a.s * b.m <= b.s * a.m;
}
inline bool operator >=(kasr a, kasr b){
return a.s * b.m >= b.s * a.m;
}
inline bool operator <(kasr a, kasr b){
return a.s * b.m < b.s * a.m;
}
inline bool operator >(kasr a, kasr b){
return a.s * b.m > b.s * a.m;
}
int n, l, per[maxn5];
ll a[maxn5][maxn5], ps[maxn5][maxn5];
kasr need[maxn5];
kasr out[maxn5];
bool mark[maxn5];
inline ll get_val(int l, int r, int i){
if(l >= r)
return 0;
return ps[i][r] - ps[i][l];
}
inline kasr get(int i, kasr last){
kasr ret (0, 1);
kasr ask = need[i];
int id = last.ciel();
if(kasr(id, 1) > last){
kasr rem = id - last;
kasr sup = kasr(ask.s, ask.m * a[i][id]);
if(sup >= rem){
last = kasr(id, 1);
ask = ask - kasr(rem.s * a[i][id], rem.m);
}
else{
return last + sup;
}
}
//cout << i << ' ' << last << ' ' << id << ' ' << ask << endl;
int lo = id, hi = l + 1;
while(hi - lo > 1){
int mid = (lo + hi) >> 1;
if(kasr(get_val(id, mid, i), 1) <= ask)
lo = mid;
else
hi = mid;
}
//cout << lo << ' ' << ask << endl;
last = kasr(lo, 1);
ask = ask - kasr(get_val(id, lo, i), 1);
kasr sup = kasr(ask.s, ask.m * a[i][lo + 1]);
//cout << last << ' ' << sup << ' ' << ask << endl;
return last + sup;
}
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin >> n >> l;
//cout << "rgit " << n << ' ' << l << endl;
for(int i = 0; i < n; i++) for(int j = 1; j <= l; j++){
cin >> a[i][j];
//cout << "aha " << i << ' ' << j << endl;
need[i].s += a[i][j];
ps[i][j] = a[i][j] + (j > 0 ? ps[i][j - 1] : 0);
}
//return 0;
for(int i = 0; i < n; i++){
//chh[i] = need[i];
//cout << "* " << i << ' ' << need[i] << endl;
need[i].m = n;
//cout << need[i] << endl;
}
kasr last(0, 1);
for(int i = 0; i < n - 1; i++){
int v = 0;
kasr have(l + 5, 1);
for(int j = 0; j < n; j++) if(!mark[j]){
kasr cur = get(j, last);
//cout << i << ' ' << j << ' ' << cur << ' ' << last << endl;
if(cur <= have){
v = j;
have = cur;
}
}
per[i] = v;
last = have;
out[i] = last;
mark[v] = true;
}
for(int i = 0; i < n; i++) if(!mark[i])
per[n - 1] = i;
for(int i = 0; i < n - 1; i++){
cout << out[i].s << ' ' << out[i].m << '\n';
}
for(int i = 0; i < n; i++)
cout << per[i] + 1 << ' ';
cout << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| 3 |
Correct |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
460 KB |
Output is correct |
| 5 |
Correct |
1 ms |
332 KB |
Output is correct |
| 6 |
Correct |
0 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
332 KB |
Output is correct |
| 8 |
Correct |
1 ms |
332 KB |
Output is correct |
| 9 |
Correct |
0 ms |
332 KB |
Output is correct |
| 10 |
Correct |
1 ms |
460 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Correct |
1 ms |
332 KB |
Output is correct |
| 13 |
Correct |
1 ms |
460 KB |
Output is correct |
| 14 |
Correct |
1 ms |
332 KB |
Output is correct |
| 15 |
Correct |
1 ms |
460 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
460 KB |
Output is correct |
| 3 |
Correct |
1 ms |
460 KB |
Output is correct |
| 4 |
Correct |
1 ms |
460 KB |
Output is correct |
| 5 |
Correct |
1 ms |
460 KB |
Output is correct |
| 6 |
Correct |
1 ms |
460 KB |
Output is correct |
| 7 |
Correct |
1 ms |
332 KB |
Output is correct |
| 8 |
Correct |
1 ms |
460 KB |
Output is correct |
| 9 |
Correct |
1 ms |
460 KB |
Output is correct |
| 10 |
Correct |
1 ms |
460 KB |
Output is correct |
| 11 |
Correct |
1 ms |
460 KB |
Output is correct |
| 12 |
Correct |
1 ms |
332 KB |
Output is correct |
| 13 |
Correct |
1 ms |
460 KB |
Output is correct |
| 14 |
Correct |
2 ms |
540 KB |
Output is correct |
| 15 |
Correct |
1 ms |
460 KB |
Output is correct |
| 16 |
Correct |
1 ms |
460 KB |
Output is correct |
| 17 |
Correct |
1 ms |
460 KB |
Output is correct |
| 18 |
Correct |
1 ms |
588 KB |
Output is correct |
| 19 |
Correct |
1 ms |
460 KB |
Output is correct |
| 20 |
Correct |
1 ms |
460 KB |
Output is correct |
| 21 |
Correct |
1 ms |
588 KB |
Output is correct |
| 22 |
Correct |
1 ms |
460 KB |
Output is correct |
| 23 |
Correct |
0 ms |
332 KB |
Output is correct |
| 24 |
Correct |
1 ms |
460 KB |
Output is correct |
| 25 |
Correct |
1 ms |
460 KB |
Output is correct |
| 26 |
Correct |
1 ms |
332 KB |
Output is correct |
| 27 |
Correct |
1 ms |
460 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| 3 |
Correct |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
460 KB |
Output is correct |
| 5 |
Correct |
1 ms |
332 KB |
Output is correct |
| 6 |
Correct |
0 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
332 KB |
Output is correct |
| 8 |
Correct |
1 ms |
332 KB |
Output is correct |
| 9 |
Correct |
0 ms |
332 KB |
Output is correct |
| 10 |
Correct |
1 ms |
460 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Correct |
1 ms |
332 KB |
Output is correct |
| 13 |
Correct |
1 ms |
460 KB |
Output is correct |
| 14 |
Correct |
1 ms |
332 KB |
Output is correct |
| 15 |
Correct |
1 ms |
460 KB |
Output is correct |
| 16 |
Correct |
1 ms |
332 KB |
Output is correct |
| 17 |
Correct |
1 ms |
460 KB |
Output is correct |
| 18 |
Correct |
1 ms |
460 KB |
Output is correct |
| 19 |
Correct |
1 ms |
460 KB |
Output is correct |
| 20 |
Correct |
1 ms |
460 KB |
Output is correct |
| 21 |
Correct |
1 ms |
460 KB |
Output is correct |
| 22 |
Correct |
1 ms |
332 KB |
Output is correct |
| 23 |
Correct |
1 ms |
460 KB |
Output is correct |
| 24 |
Correct |
1 ms |
460 KB |
Output is correct |
| 25 |
Correct |
1 ms |
460 KB |
Output is correct |
| 26 |
Correct |
1 ms |
460 KB |
Output is correct |
| 27 |
Correct |
1 ms |
332 KB |
Output is correct |
| 28 |
Correct |
1 ms |
460 KB |
Output is correct |
| 29 |
Correct |
2 ms |
540 KB |
Output is correct |
| 30 |
Correct |
1 ms |
460 KB |
Output is correct |
| 31 |
Correct |
1 ms |
460 KB |
Output is correct |
| 32 |
Correct |
1 ms |
460 KB |
Output is correct |
| 33 |
Correct |
1 ms |
588 KB |
Output is correct |
| 34 |
Correct |
1 ms |
460 KB |
Output is correct |
| 35 |
Correct |
1 ms |
460 KB |
Output is correct |
| 36 |
Correct |
1 ms |
588 KB |
Output is correct |
| 37 |
Correct |
1 ms |
460 KB |
Output is correct |
| 38 |
Correct |
0 ms |
332 KB |
Output is correct |
| 39 |
Correct |
1 ms |
460 KB |
Output is correct |
| 40 |
Correct |
1 ms |
460 KB |
Output is correct |
| 41 |
Correct |
1 ms |
332 KB |
Output is correct |
| 42 |
Correct |
1 ms |
460 KB |
Output is correct |
| 43 |
Runtime error |
117 ms |
18092 KB |
Execution killed with signal 8 |
| 44 |
Halted |
0 ms |
0 KB |
- |
