oj.uz

답안 #430417

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
430417 2021-06-16T13:35:51 Z alishahali1382 기지국 (IOI20_stations) C++14
8 / 100
 1115 ms 568 KB 
#include "stations.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define debug(x) {cerr<<#x<<"="<<x<<"\n";}
#define debug2(x, y) {cerr<<"{"<<#x<<", "<<#y<<"}={"<<x<<", "<<y<<"}\n";}
#define debugp(p) {cerr<<#p<<"={"<<p.first<<", "<<p.second<<"}\n";}
#define debugv(abcd) {cerr<<#abcd<<": "; for (auto dcba:abcd) cerr<<dcba<<", ";cerr<<"\n";}
#define pb push_back
#define all(x) x.begin(), x.end()
#define SZ(x) ((int)x.size())

const int inf=1000000100; // 1e9
const ll INF=10000000001000000; // 1e16
const int mod=1000000007;
const int MAXN=1010;

int n, m, k, x, y, a, b, t, ans;
vi A, B;

vi label(int _n, int _k, vi U, vi V){
	n=_n;
	k=_k;
	vi out(n);
	for (int i = 0; i < n; i++) {
		out[i] = i;
	}
	return out;
}

int find_next_station(int s, int t, vi adj){
	s++;
	t++;
	int tt=t;
	while (tt>1 && tt/2!=s) tt/=2;
	if (tt/2==s) return tt-1;
	return s/2-1;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 519 ms 400 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 453 ms 568 KB Output is correct
2 Correct 934 ms 476 KB Output is correct
3 Correct 1115 ms 488 KB Output is correct
4 Correct 819 ms 400 KB Output is correct
5 Correct 783 ms 488 KB Output is correct
6 Correct 550 ms 400 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 651 ms 528 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1037 ms 404 KB Output is correct
2 Incorrect 836 ms 400 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 670 ms 400 KB Wrong query response.
2 Halted 0 ms 0 KB -