結果
| 問題 | No.3389 k-Days Later |
| コンテスト | |
| ユーザー |
AngrySadEight
|
| 提出日時 | 2025-11-29 00:48:42 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 4,189 bytes |
| コンパイル時間 | 3,297 ms |
| コンパイル使用メモリ | 185,520 KB |
| 実行使用メモリ | 8,064 KB |
| 最終ジャッジ日時 | 2025-11-29 00:49:09 |
| 合計ジャッジ時間 | 25,810 ms |
|
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 6 WA * 22 |
ソースコード
#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>
template <typename T>
void debug(T e) {
cerr << e << endl;
}
template <typename T>
void debug(vector<T> &v) {
rep(i, v.size()) { cerr << v[i] << " "; }
cerr << endl;
}
template <typename T>
void debug(vector<vector<T>> &v) {
rep(i, v.size()) {
rep(j, v[i].size()) { cerr << v[i][j] << " "; }
cerr << endl;
}
}
template <typename T>
void debug(vector<pair<T, T>> &v) {
rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}
template <typename T>
void debug(set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); itr++) {
cerr << *itr << " ";
}
cerr << endl;
}
template <typename T>
void debug(multiset<T> &ms) {
for (auto itr = ms.begin(); itr != ms.end(); itr++) {
cerr << *itr << " ";
}
cerr << endl;
}
template <typename T>
void debug(map<T, T> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); itr++) {
cerr << itr->first << " " << itr->second << endl;
}
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << H << " ";
debug_out(T...);
}
using mint = modint998244353;
void debug_mint1(vector<mint> &vec) {
for (int i = 0; i < vec.size(); i++) {
cerr << vec[i].val() << " ";
}
cerr << endl;
}
void debug_mint2(vector<vector<mint>> &vec) {
for (int i = 0; i < vec.size(); i++) {
for (int j = 0; j < vec[i].size(); j++) {
cerr << vec[i][j].val() << " ";
}
cerr << endl;
}
}
int main() {
ll N;
cin >> N;
vector<ll> D(N);
for (ll i = 0; i < N; i++){
cin >> D[i];
}
vector<ll> sums(N + 1, 0);
for (ll i = 0; i < N; i++){
sums[i + 1] = sums[i] + D[i];
}
ll one_year = 0;
for (ll i = 0; i < N; i++){
one_year += D[i];
}
// 0-indexed の日付で何日目かを、年月日に対応させる
auto ymd_to_day = [&D, &sums, one_year](ll y1, ll m1, ll d1){
ll day = 0;
day += (y1 - 1) * one_year;
day += sums[m1 - 1];
day += (d1 - 1);
return day;
};
auto day_to_ymd = [&D, &sums, one_year](ll day){
ll y1 = day / one_year;
ll rem = day - y1 * one_year;
auto it = upper_bound(all(sums), rem);
it--;
ll m1 = it - sums.begin();
ll d1 = rem - sums[m1];
return make_tuple(y1 + 1, m1 + 1, d1 + 1);
};
debug(sums);
ll Q;
cin >> Q;
vector<ll> y(Q);
vector<ll> m(Q);
vector<ll> d(Q);
vector<ll> k(Q);
for (ll i = 0; i < Q; i++){
cin >> y[i] >> m[i] >> d[i] >> k[i];
}
for (ll i = 0; i < Q; i++){
ll day = ymd_to_day(y[i], m[i], d[i]);
tuple<ll, ll, ll> tp = day_to_ymd(day + k[i]);
cout << get<0>(tp) << " " << get<1>(tp) << " " << get<2>(tp) << endl;
}
}
AngrySadEight