# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797922 | vjudge1 | Worst Reporter 3 (JOI18_worst_reporter3) | C++14 | 444 ms | 26980 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std ;
const ll N = 5e5 ;
ll n, q, tn, d[N + 1], ans[N + 1], pref[N + 1] ;
struct query
{
ll t, l, r, ind ;
};
vector<query> qr ;
signed main()
{
ios_base::sync_with_stdio( 0 ) ;
cin.tie( 0 ) ;
cout.tie( 0 ) ;
cin >> n >> q ;
for(ll i = 1 ; i <= n ; i++)
cin >> d[i] ;
for(ll i = 1 ; i <= q ; i++)
{
query q ;
cin >> q.t >> q.l >> q.r ;
q.ind = i ;
qr.push_back(q) ;
}
pref[1] = d[1] ;
for(ll i = 2 ; i <= n ; i++)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |