QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#460175#5531. ICCfryan0 1ms4292kbC++201.4kb2024-07-01 04:18:082024-07-01 04:26:57

Judging History

你现在查看的是测评时间为 2024-07-01 04:26:57 的历史记录

  • [2024-07-01 04:29:12]
  • 管理员手动重测本题所有提交记录
  • 测评结果:0
  • 用时:1ms
  • 内存:4232kb
  • [2024-07-01 04:26:57]
  • 管理员手动重测该提交记录
  • 测评结果:0
  • 用时:1ms
  • 内存:4292kb
  • [2024-07-01 04:18:08]
  • 评测
  • 测评结果:100
  • 用时:1ms
  • 内存:4108kb
  • [2024-07-01 04:18:08]
  • 提交

answer

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#include "icc.h"
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

vector<int> gen(int cyc, int len) {
	vector<int> res; res.resize(len);
	for (int b = 0; b < len; b += cyc) {
		for (int i = b; i < min(len, b+cyc); i++) {
			res[i] = (b/cyc)%2;
		}
	}
	return res;
}

const int mxn = 1e2;
int aux1[mxn], aux2[mxn];

int send_query(vector<int> &a, vector<int> &b) {
	for (int i = 0; i < sz(a); i++) {
		aux1[i] = a[i];
	}
	for (int i = 0; i < sz(b); i++) {
		aux2[i] = b[i];
	}
	return query(sz(a), sz(b), aux1, aux2);
	
}

array<int,2> get_edge(vector<int> &a, vector<int> &b) {
	if (sz(a) == 1 && sz(b) == 1) {
		return {a[0], b[0]};
	}
	if (sz(a) < sz(b)) swap(a,b);
	vector<int> ra; ra.resize((sz(a)+1)/2);
	for (int i = 0; i < (sz(a)+1)/2; i++) {
		ra[i] = a[i];
	}
	
}

void run(int n) {
	vector<int> t1 = {1};
	vector<int> t2 = {2};
	send_query(t1,t2);
}

/*
signed main() {
		
	return 0;
}*/

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 4092kb

input:

1
1500 3
15

0
2

0.0
2.5

0
3.5

0

1 1

output:

0
Not all edges were guessed!

result:

wrong answer 

Subtask #2:

score: 0
Wrong Answer

Test #3:

score: 0
Wrong Answer
time: 1ms
memory: 4220kb

input:

1
2500 4
50

0
0

0.0
3.5

0
2.5

5

1 1

output:

0
Not all edges were guessed!

result:

wrong answer 

Subtask #3:

score: 0
Wrong Answer

Test #6:

score: 0
Wrong Answer
time: 1ms
memory: 4084kb

input:

1
2250 6
100

0.05
2.3

0.1
0.7

0
1.5

1.7

1.1 1

output:

0
Not all edges were guessed!

result:

wrong answer 

Subtask #4:

score: 0
Wrong Answer

Test #10:

score: 0
Wrong Answer
time: 1ms
memory: 4292kb

input:

1
2000 5
100

0.01
1.00

0.10
1.70

0.00
1.50

5.0

1.20 1

output:

0
Not all edges were guessed!

result:

wrong answer 

Subtask #5:

score: 0
Wrong Answer

Test #14:

score: 0
Wrong Answer
time: 1ms
memory: 4216kb

input:

1
1775 4
100

0.00
0.00

0.00
2.70

0.10
7.55

0.0

1.15 1

output:

0
Not all edges were guessed!

result:

wrong answer 

Subtask #6:

score: 0
Wrong Answer

Test #20:

score: 0
Wrong Answer
time: 1ms
memory: 4132kb

input:

1
1625 5
100

0.00
0.00

0.00
3.00

0.00
1.00

0.0

3 1

output:

0
Not all edges were guessed!

result:

wrong answer