oj.uz

답안 #429178

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
429178 2021-06-15T18:16:06 Z chirathnirodha Finding Routers (IOI20_routers) C++17
60 / 100
 3 ms 296 KB 
//Coded by Chirath Nirodha
#include<bits/stdc++.h>
using namespace std;
#include "routers.h"
#define MP make_pair
#define PB push_back
#define F first
#define S second
typedef long long ll;

vector<int> find_routers(int l, int n, int q) {
    vector<int> ans;
    if(n==2){
      ll a=0,b=l;
      while(b-a>1){
        ll m=(a+b)/2;
        int idx=use_detector(m);
        if(idx==0)a=m;
        else b=m;
      }
      ans.PB(0);
      ans.PB(2*a);
    }
    else{
      int cur=1;
      ans.PB(0);
      for(int i=1;i<=l;i++){
        int idx=use_detector(i);
        if(idx==cur){
          ans.PB(ans[ans.size()-1]+(i-1-ans[ans.size()-1])*2);
          cur++;
        }
        if(ans.size()==n)break;
      }
    }
	return ans;
}

Compilation message

routers.cpp: In function 'std::vector<int> find_routers(int, int, int)':
routers.cpp:33:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |         if(ans.size()==n)break;
      |            ~~~~~~~~~~^~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 296 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 2 ms 288 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 2 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 2 ms 204 KB Output is correct
13 Correct 2 ms 204 KB Output is correct
14 Correct 2 ms 204 KB Output is correct
15 Correct 2 ms 204 KB Output is correct
16 Correct 2 ms 204 KB Output is correct
17 Correct 2 ms 204 KB Output is correct
18 Correct 2 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 2 ms 204 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct

Subtask #4
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 204 KB Too many queries used
2 Halted 0 ms 0 KB -