結果
問題 | No.1021 Children in Classrooms |
ユーザー |
![]() |
提出日時 | 2020-08-18 11:14:13 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,463 bytes |
コンパイル時間 | 1,190 ms |
コンパイル使用メモリ | 116,096 KB |
最終ジャッジ日時 | 2025-01-13 02:57:30 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 11 WA * 5 RE * 1 |
コンパイルメッセージ
main.cpp: In function ‘void get(std::vector<long long int>&)’: main.cpp:25:38: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 25 | void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);} | ~~~~~^~~~~~~~~~~~~~ main.cpp: In function ‘void get(std::vector<std::vector<long long int> >&)’: main.cpp:26:56: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 26 | void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);} | ~~~~~^~~~~~~~~~~~~~~~~
ソースコード
#include <iostream>#include <string>#include <vector>#include <queue>#include <deque>#include <algorithm>#include <set>#include <map>#include <bitset>#include <cmath>#include <functional>#include <iomanip>#define vll vector<ll>#define vvvl vector<vvl>#define vvl vector<vector<ll>>#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));#define re(c, b) for(ll c=0;c<b;c++)#define rep(a,b,c) for(ll a=b;a<c;a++)#define all(obj) (obj).begin(), (obj).end()typedef long long int ll;typedef long double ld;using namespace std;void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}int main() {ll n, m;std::cin >> n >> m;vll a(n);get(a);ll num = 0;ll MIN = 0, MAX = 0;string s;std::cin >> s;for(auto c:s){if(c=='L') num--;else num++;MIN = min(MIN, num);MAX = max(MAX, num);}MIN = max(-(n-1), MIN);MAX = min(n-1, MAX);num = min(n-1, max(-(n-1), num));ll l = abs(MIN);for(int i=0;i<l;i++) a[l]+=a[i], a[i]=0;ll r = n-1-MAX;for(int i=r+1;i<n;i++) a[r]+=a[i], a[i]=0;vll ans(n, 0);for(int i=0;i<n;i++){if(a[i]==0) continue;ans[i+num] = a[i];}print(ans);}