oj.uz

답안 #766014

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
766014 2023-06-25T08:45:33 Z ono_de206 자동 인형 (IOI18_doll) C++14
6 / 100
 273 ms 262144 KB 
#include "doll.h"
#include<bits/stdc++.h>
using namespace std;

#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

void create_circuit(int m, std::vector<int> a) {
	int n = a.size();
	vector<int> c(m + 1, 0), x, y;
	vector<vector<int>> g(m + 1);
	a.pb(0);
	g[0].pb(a[0]);
	for(int i = 0; i < n; i++) {
		g[a[i]].pb(a[i + 1]);
	}

	auto add = [&](int X, int Y) -> int {
		x.pb(X);
		y.pb(Y);
		return -(int)x.size();
	};

	for(int i = 0; i <= m; i++) {
		int sz = g[i].size();
		if(sz == 0) continue;
		int tmp = 1;
		while(tmp * 2 < sz) tmp *= 2;
		while(g[i].size() < tmp) g[i].pb(0);
		vector<int> nwg;
		while(g[i].size() > 1) {
			for(int j = 0; j < g[i].size(); j += 2) {
				nwg.pb(add(g[i][j], g[i][j + 1]));
			}
			swap(nwg, g[i]);
		}
		c[i] = g[i][0];
	}
	answer(c, x, y);
}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:42:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   42 |   while(g[i].size() < tmp) g[i].pb(0);
      |         ~~~~~~~~~~~~^~~~~
doll.cpp:45:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |    for(int j = 0; j < g[i].size(); j += 2) {
      |                   ~~^~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 20 ms 6392 KB Output is correct
3 Correct 16 ms 5072 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 9 ms 3796 KB Output is correct
6 Correct 25 ms 7628 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 20 ms 6392 KB Output is correct
3 Correct 16 ms 5072 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 9 ms 3796 KB Output is correct
6 Correct 25 ms 7628 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 39 ms 7316 KB Output is correct
9 Correct 37 ms 9556 KB Output is correct
10 Correct 51 ms 12696 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 20 ms 6392 KB Output is correct
3 Correct 16 ms 5072 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 9 ms 3796 KB Output is correct
6 Correct 25 ms 7628 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 39 ms 7316 KB Output is correct
9 Correct 37 ms 9556 KB Output is correct
10 Correct 51 ms 12696 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Runtime error 273 ms 262144 KB Execution killed with signal 9
15 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 233 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 245 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 245 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -