Submission #1252026

#TimeUsernameProblemLanguageResultExecution timeMemory
1252026fahmid_rngFinding Routers (IOI20_routers)C++20
16 / 100
0 ms328 KiB
#include<bits/stdc++.h>
#include "routers.h"
using namespace std;
std::vector<int> find_routers(int l, int n, int q) {
    vector<int> p(n);
    p[0]=0;
    int last=use_detector(1),f=1;
    for(int i=2;i<=l && f<n;){
      int curr=use_detector(i);
      if(curr==last+1){
        p[f]=2*(i-1)-p[f-1];
        f++;
        i=p[f]+1;
      }
      else{i++;}
      last=curr;
    }
    return p;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...