結果
| 問題 |
No.3068 Speedrun (Hard)
|
| コンテスト | |
| ユーザー |
 sibasyun
|
| 提出日時 | 2025-03-21 22:37:58 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 7,166 bytes |
| コンパイル時間 | 6,260 ms |
| コンパイル使用メモリ | 277,908 KB |
| 実行使用メモリ | 7,328 KB |
| 最終ジャッジ日時 | 2025-03-21 22:38:21 |
| 合計ジャッジ時間 | 20,801 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 15 RE * 14 TLE * 3 |
ソースコード
#include <bits/stdc++.h>
#include <atcoder/all>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <random>
#include <chrono>
#include <cstdint>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace atcoder;
using namespace __gnu_pbds;
using mint = modint998244353;
// using mint = modint1000000007;
using str = string;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vvvl = vector<vector<vector<long long>>>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
using vvvm = vector<vector<vector<mint>>>;
using vs = vector<string>;
using vvs = vector<vector<string>>;
using ll = long long;
using pd_ds_set_int = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
using pd_ds_set_ll = tree<long long, null_type, less<long long>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, f, n) for (int i = (int) f; i < (int)(n); i++)
#define repd(i, n, l) for (int i = (int) n; i >= (int) l; i--)
#define all(p) p.begin(),p.end()
vector<pair<int, int>> dydx{ {-1, 0}, {1, 0}, {0, -1 }, {0, 1} };
const ll inf = 1LL << 60;
void print() { putchar(' '); }
void print(bool a) { printf("%d", a); }
void print(int a) { printf("%d", a); }
void print(unsigned a) { printf("%u", a); }
void print(long a) { printf("%ld", a); }
void print(long long a) { printf("%lld", a); }
void print(unsigned long long a) { printf("%llu", a); }
void print(char a) { printf("%c", a); }
void print(char a[]) { printf("%s", a); }
void print(const char a[]) { printf("%s", a); }
void print(float a) { printf("%.15f", a); }
void print(double a) { printf("%.15f", a); }
void print(long double a) { printf("%.15Lf", a); }
void print(const string& a) { for (auto&& i : a) print(i); }
template<class T> void print(const complex<T>& a) { if (a.real() >= 0) print('+'); print(a.real()); if (a.imag() >= 0) print('+'); print(a.imag()); print('i'); }
template<class T> void print(const vector<T>&);
template<class T, size_t size> void print(const array<T, size>&);
template<class T, class L> void print(const pair<T, L>& p);
template<class T, size_t size> void print(const T(&)[size]);
template<class T> void print(const vector<T>& a) { if (a.empty()) return; print(a[0]); for (auto i = a.begin(); ++i != a.end(); ) { putchar(' '); print(*i); } }
template<class T> void print(const deque<T>& a) { if (a.empty()) return; print(a[0]); for (auto i = a.begin(); ++i != a.end(); ) { putchar(' '); print(*i); } }
template<class T, size_t size> void print(const array<T, size>& a) { print(a[0]); for (auto i = a.begin(); ++i != a.end(); ) { putchar(' '); print(*i); } }
template<class T, class L> void print(const pair<T, L>& p) { print(p.first); putchar(' '); print(p.second); }
template<class T, size_t size> void print(const T(&a)[size]) { print(a[0]); for (auto i = a; ++i != end(a); ) { putchar(' '); print(*i); } }
template<class T> void print(const T& a) { cout << a; }
constexpr ll ten(int n) {
return n == 0 ? 1 : ten(n - 1) * 10;
}
bool MASKI(int mask, int i) {
return (mask >> i) & 1;
}
bool MASKL(ll mask, int i) {
return (mask >> (ll)i) & 1;
}
template <typename T>
vector<T> compress_coordinate(vector<T>& A) {
int n = A.size();
vector<T> B(n);
rep(i, n) B[i] = A[i];
sort(B.begin(), B.end());
B.erase(unique(B.begin(), B.end()), B.end());
return B;
}
vector<vector<int>> unweighted_graph(int n, int m) {
vector<vector<int>> ret(n);
while (m--) {
int a, b;
cin >> a >> b;
a--; b--;
ret[a].push_back(b);
ret[b].push_back(a);
}
return ret;
}
vector<vector<pair<int, long long>>> weighted_graph(int n, int m) {
vector<vector<pair<int, long long>>> ret(n);
while (m--) {
int a, b;
long long c;
cin >> a >> b >> c;
a--, b--;
ret[a].push_back({ b, c });
ret[b].push_back({ a, c });
}
return ret;
}
template<typename T>
int argmin(vector<T>& a) {
T mi = *min_element(all(a));
for (int i = 0; i < a.size(); i++) {
if (a[i] == mi) return i;
}
}
template<typename T>
int argmax(vector<T>& a) {
T ma = *max_element(all(a));
for (int i = 0; i < a.size(); i++) {
if (a[i] == ma) return i;
}
}
long long extGCD(long long a, long long b, long long& x, long long& y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
int main() {
ll A[4];
ll B[4];
ll N, T;
rep(i, 4) cin >> A[i];
cin >> N;
rep(i, 4) cin >> B[i];
cin >> T;
ll a0 = B[0] - B[3];
ll a = B[1] - B[3];
ll b = B[2] - B[3];
ll g = __gcd(a, b);
// cout << g << endl;
ll y, z;
extGCD(a, b, y, z); // a * y + b * z = 1
ll aa = a / g;
ll bb = b / g;
// cout << aa << ' ' << bb << endl;
// cout << y << ' ' << z << endl;
// cout << aa * y + bb * z << endl;
rep(x, A[0] + 1) {
if (x > N) break;
ll temp = T - B[3] * N - a0 * x;
// if (temp < 0) continue;
if (temp % g != 0) continue;
ll yy = y * temp / g;
ll zz = z * temp / g;
ll tt = temp / g;
// cout << yy << ' ' << zz << ' ' << tt << endl;
rep(j, A[1] + 1) {
bool f = false;
// iが解となり得るかを調べる
if ((tt - aa * j) % bb != 0) continue;
f = true;
rep(i, 10000) {
ll y2 = j + i * bb;
ll z2 = (tt - aa * y2) / bb;
// if (y2 < 0 || z2 < 0) break;
if (bb < 0 && y2 < 0) break;
if (bb > 0 && y2 > A[1]) break;
if (y2 + z2 > N - x)continue;
if (z2 > A[2]) continue;
if (z2 < 0) continue;
ll k = N - x - y2 - z2;
if (k > A[3] || k < 0) continue;
assert(x * B[0] + y2 * B[1] + z2 * B[2] + k * B[3] == T);
cout << x << ' ' << y2 << ' ' << z2 << ' ' << N - x - y2 - z2 << endl;
return 0;
}
rep(i, 10000) {
ll y2 = j - i * bb;
ll z2 = (tt - aa * y2) / bb;
// if (y2 < 0 || z2 < 0) break;
if (bb < 0 && y2 < 0) break;
if (bb > 0 && y2 > A[1]) break;
if (y2 + z2 > N - x)continue;
if (z2 > A[2]) continue;
if (z2 < 0) continue;
ll k = N - x - y2 - z2;
if (k > A[3] || k < 0) continue;
assert(x * B[0] + y2 * B[1] + z2 * B[2] + k * B[3] == T);
cout << x << ' ' << y2 << ' ' << z2 << ' ' << N - x - y2 - z2 << endl;
return 0;
}
if (f) break;
}
}
}