oj.uz

답안 #626304

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
626304 2022-08-11T11:18:00 Z Karliver Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 257 ms 18652 KB 
	
#include <bits/stdc++.h>

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()
#define ff first
#define se second
#define mp make_pair
using ll = long long;
int mod = (ll)1e9 + 7;
const int INF = 1e9 + 1;
const int N = 2e5 + 100;
const double eps = 1e-7;

template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
    return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
    return (x > y ? x = y, 1 : 0);
}



void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)


void solve() {
	
	int n;
	cin >> n;
	vector<int> a(n + 1), b(n);
	vector<int> res(n + 1);
	for(int &c : a) cin >> c;
	
	for(int &c : b) cin >> c;
	vector<int> id(n + 1);
	iota(begin(id), end(id), 0);
	sort(begin(id), end(id), [&](int x, int y) {
		return a[x] < a[y];
	});
	
	sort(begin(b), end(b));
	
	multiset<int> st;
	for(int j = 0;j < n;++j) {
		st.insert(max(a[id[j]]-b[j], 0));
	}
	res[id[n]] = *st.rbegin();
	
	for(int j = n - 1;j >= 0;--j) {
		int y = max(a[id[j]] - b[j], 0);
		auto it = st.find(y);
		assert(it != st.end());
		st.erase(it);
		st.insert(max(0, a[id[j+1]]-b[j]));
		res[id[j]] = *st.rbegin();
	}
	for(int &c : res) cout << c << ' ';
	cout << '\n';
		
	

}
void test_case() {
    int t;
    cin >> t;
    forn(p, t) {

        //cout << "Case #" << p + 1 << ": ";
        solve();
    }
}
int main() {

    ios::sync_with_stdio(false);
    cin.tie(0);

    solve();

}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 316 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 316 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 2 ms 436 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 376 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 372 KB Output is correct
27 Correct 2 ms 456 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 464 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 316 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 2 ms 436 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 376 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 372 KB Output is correct
27 Correct 2 ms 456 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 464 KB Output is correct
33 Correct 174 ms 17360 KB Output is correct
34 Correct 205 ms 18104 KB Output is correct
35 Correct 178 ms 17536 KB Output is correct
36 Correct 184 ms 18136 KB Output is correct
37 Correct 192 ms 18652 KB Output is correct
38 Correct 173 ms 18340 KB Output is correct
39 Correct 225 ms 17272 KB Output is correct
40 Correct 240 ms 17240 KB Output is correct
41 Correct 242 ms 17460 KB Output is correct
42 Correct 239 ms 17444 KB Output is correct
43 Correct 257 ms 17308 KB Output is correct
44 Correct 181 ms 16828 KB Output is correct
45 Correct 175 ms 16860 KB Output is correct
46 Correct 193 ms 16832 KB Output is correct
47 Correct 155 ms 17424 KB Output is correct
48 Correct 158 ms 17228 KB Output is correct
49 Correct 245 ms 17892 KB Output is correct
50 Correct 231 ms 17816 KB Output is correct
51 Correct 242 ms 17860 KB Output is correct
52 Correct 249 ms 18004 KB Output is correct
53 Correct 225 ms 17880 KB Output is correct