# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
568253 | almothana05 | Restore Array (RMI19_restore) | C++14 | 376 ms | 980 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 mod 1000000007
#define inf 10000000000000000
using namespace std;
// vector<pair<int , int> >gr[2000000];
long long dist[2000000] ;
// priority_queue<pair<int , int> >q;
vector<int>edge[3];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int menge , numm , nummer , que , cmp , bi;
cin >> menge >> que;
for(int i = 0 ; i < menge; i++){
edge[0].push_back(i);
edge[1].push_back(i + 1);
edge[2].push_back(1);
edge[0].push_back(i + 1);
edge[1].push_back(i);
edge[2].push_back(0);
}
while(que--){
cin >> numm >> nummer >> cmp >> bi;
// numm++;
nummer++;
if(bi == 0){
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... |