結果
問題 | No.909 たぴの配置 |
ユーザー |
![]() |
提出日時 | 2019-11-01 16:26:39 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 299 ms / 3,000 ms |
コード長 | 2,363 bytes |
コンパイル時間 | 1,233 ms |
コンパイル使用メモリ | 116,272 KB |
実行使用メモリ | 7,936 KB |
最終ジャッジ日時 | 2024-09-14 22:45:38 |
合計ジャッジ時間 | 6,937 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 13 |
ソースコード
#include <algorithm>#include <bitset>#include <complex>#include <deque>#include <exception>#include <fstream>#include <functional>#include <iomanip>#include <ios>#include <iosfwd>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <locale>#include <map>#include <memory>#include <new>#include <numeric>#include <ostream>#include <queue>#include <set>#include <sstream>#include <stack>#include <stdexcept>#include <streambuf>#include <string>#include <typeinfo>#include <utility>#include <valarray>#include <vector>#include <climits>#include <cstring>#define rep(i, m, n) for(int i=int(m);i<int(n);i++)#define all(c) begin(c),end(c)template<typename T1, typename T2>inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }template<typename T1, typename T2>inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }typedef long long int ll;using ll = long long int;using ull = long long unsigned int;using Int = long long int;using namespace std;#define INF (1 << 30) - 1#define INFl (ll)5e15#define DEBUG 0#define dump(x) cerr << #x << " = " << (x) << endl#define MOD 1000000007//editclass Solve {public:void solve() {Int N;cin >> N;vector<Int> X(N + 1), Y(N + 1);for (int i = 1; i <= N; ++i) {cin >> X[i];}for (int i = 1; i <= N; ++i) {cin >> Y[i];}vector<Int> T(N + 2);T[N + 1] = INFl;int idx = -1;for (int i = 1; i <= N; ++i) {if (T[N + 1] > X[i] + Y[i]) {T[N + 1] = min(T[N + 1], X[i] + Y[i]);// T[i] = X[i];idx = i;}}for (int i = 1; i <= N; ++i) {if (i == idx) {T[i] = X[i];} else {T[i] = max<Int>(T[N + 1] - Y[i], 0);}}// for (int i = 1; i <= N; ++i) {// T[i] = T[N + 1] - Y[i];// cerr << T[N + 1] - Y[i] << " " << T[0] + X[i] << endl;// }//cout << T[N + 1] << endl;for (int i = 0; i <= N + 1; ++i) {cout << T[i] << endl;}}};int main() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(10);Solve().solve();return 0;}