# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199606 | Ruxandra985 | Restore Array (RMI19_restore) | C++14 | 111 ms | 116448 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 DIMN 5010
#define DIMM 10010
using namespace std;
vector <pair <int , pair <int,int> > > v[DIMN];
int inq[DIMN], sir[DIMN];
deque <int> q;
pair <int,int> sol[DIMN];
pair <int,int> pos[DIMN][DIMN];
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int n , m , i , l , r , k , val , nod , vecin , mini , maxi , j , poz;
fscanf (fin,"%d%d",&n,&m);
for ( i = 1 ; i <= m ; i++ ){
fscanf (fin,"%d%d%d%d",&l,&r,&k,&val);
l++;
r++;
if (val == 1){
mini = (r - (l + k - 1) + 1);
maxi = (r - l + 1);
}
else {
mini = 0;
maxi = (r - l + 1 - k);
}
///mini si maxi = cate 1 uri ar putea fi in intervalul i
v[l-1].push_back(make_pair (r , make_pair(mini , maxi)));
v[r].push_back(make_pair (l-1 , make_pair(mini , maxi)));
Compilation message (stderr)
# | 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... |