# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
825630 | MohamedAhmed04 | Arranging Tickets (JOI17_arranging_tickets) | C++14 | 384 ms | 468 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>
using namespace std ;
const int MAX = 22 ;
int arr[MAX] ;
int n , m ;
int L[MAX] , R[MAX] , C[MAX] ;
int cnt[MAX] ;
void Apply1(int l , int r , int x)
{
for(int i = l ; i < r ; ++i)
cnt[i] += x ;
}
void Apply2(int l , int r , int x)
{
for(int i = 1 ; i <= n ; ++i)
{
if(i < l || i >= r)
cnt[i] += x ;
else
cnt[i] -= x ;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |