UOJ Logo

NOI.AC

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#213103#2348. LifeSTASISZHY605564ms5968kbC++11999b2024-11-09 20:02:472024-11-09 23:11:12

answer

#include<bits/stdc++.h>
//#define int long long
#define fi first
#define se second
#define PII pair<int, int>

using namespace std;

const int N = 2e5 + 10, M = 1e6 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f;

int n, m, q, ans;
int s[N], dp[N], id[N];

vector<int> e[N], v;
// unordered_map<int, int> mp;

signed main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> q;
	for(int i = -1 * n; i <= n; i ++) v.push_back(i * i * i), id[v.size() - 1] = i;
	while(q --)
	{
		int x; cin >> x; bool flag = false;
		for(int i = 0; i < v.size(); i ++)
		{
			if(flag) break;
			for(int j = i; j < v.size(); j ++)
			{
				int now = x - v[i] - v[j];
				if(now < v[0]) break;
				int p = lower_bound(v.begin(), v.end(), now) - v.begin();
				if(now == v[p])
				{
					flag = true;
					cout << id[j] << ' ' << id[p] << ' ' << id[i] << '\n';
					break; 
				}
			}
		}
		if(!flag) cout << n + 1 << ' ' << n + 1 << ' ' << n + 1 << '\n';
	}	
	return 0;
}

详细

小提示:点击横条可展开更详细的信息

Test #1:

score: 10
Accepted
time: 3ms
memory: 5960kb

input:

98 10
5487
1899
3043
5373
2368
3993
723
9567
6812
901

output:

-10 47 -46
44 72 -77
-29 42 -36
45 66 -72
0 16 -12
44 44 -55
58 64 -77
12 31 -28
27 65 -66
-8 14 -11

result:

ok Correct!


Test #2:

score: 10
Accepted
time: 8ms
memory: 5956kb

input:

99 10
6139
3749
7532
3544
3976
345
522
8442
6400
7965

output:

100 100 100
100 100 100
-1 21 -12
-40 57 -49
42 50 -58
1 7 1
5 12 -11
-47 89 -84
-12 28 -24
2 52 -51

result:

ok Correct!


Test #3:

score: 10
Accepted
time: 8ms
memory: 5960kb

input:

98 10
5078
9597
9394
9368
8777
6955
8020
5115
398
3771

output:

99 99 99
99 99 99
5 21 2
-12 44 -42
-15 46 -44
26 59 -60
-8 21 -9
10 19 -14
15 31 -32
14 19 -18

result:

ok Correct!


Test #4:

score: 10
Accepted
time: 1846ms
memory: 5964kb

input:

91 10000
163
6364
2583
7101
5320
483
6442
1028
1209
1710
5617
296
7228
1593
4580
5559
9699
2015
6397...

output:

-68 91 -76
-24 43 -39
9 13 -7
-6 30 -27
36 82 -84
-4 14 -13
92 92 92
37 55 -60
7 13 -11
-35 57 -52
-...

result:

ok Correct!


Test #5:

score: 10
Accepted
time: 1511ms
memory: 5968kb

input:

91 10000
6480
8776
1711
1745
4845
3338
343
3167
8450
2756
2252
4375
4912
9822
8053
1533
1216
4161
61...

output:

-39 87 -84
61 62 -77
-33 58 -54
21 23 -27
13 22 -20
13 20 -19
7 91 -91
-10 23 -20
-6 39 -37
7 13 6
9...

result:

ok Correct!


Test #6:

score: 10
Accepted
time: 2188ms
memory: 5964kb

input:

95 10000
91
6885
8279
384
5310
2877
4483
2176
267
393
5446
7415
3853
4223
8480
3368
6752
9898
5779
7...

output:

0 6 -5
68 69 -86
-36 63 -58
-46 62 -52
12 17 -11
5 14 2
-26 51 -48
20 20 -24
-4 11 -10
96 96 96
3 43...

result:

ok Correct!


Test #7:

score: 0
Time Limit Exceeded

input:

952 10000
2160
9764
2079
4616
9459
4653
4400
6373
2089
7189
4202
4497
6684
119
1191
2206
9287
5365
1...

output:


result:


Test #8:

score: 0
Time Limit Exceeded

input:

992 10000
2576
3876
8352
3311
9101
5255
5420
145
7396
6040
8529
9794
5164
4302
7147
3683
152
1136
79...

output:


result:


Test #9:

score: 0
Time Limit Exceeded

input:

996 10000
2189
8757
4831
6765
991
2216
9313
7968
7020
9945
988
9422
7315
2132
2333
5962
1798
8184
22...

output:


result:


Test #10:

score: 0
Time Limit Exceeded

input:

988 10000
1785
1065
1261
3054
2475
693
9109
9404
1153
4364
1847
8539
4364
9471
6183
6855
303
306
635...

output:


result: