NOI.AC
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #213161 | #2348. Life | jsxheng | 30 | 90ms | 5820kb | C++11 | 1.0kb | 2024-11-09 21:57:10 | 2024-11-09 23:23:44 |
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
namespace IO{
template<typename T> inline void read(T &x){
bool f=1;x=0;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=0;ch=getchar();}
while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch&15),ch=getchar();
x=f?x:-x;
}
template<typename T> inline void write(T x){
if(x<0) putchar('-'),x=-x;
if(x>9) write(x/10);
putchar(('0'+x%10));
}
template <typename T,typename ...Args> inline void read(T &x,Args &...args){read(x);read(args...);}
template<typename T> inline void write(T x,char c){write(x),putchar(c);}
}
using namespace IO;
int l,q,x;
unordered_map<int,int> st;
signed main(){
read(l,q);
for(int i=-l;i<=l;++i)st[i*i*i]=1;
while(q--){
read(x);
int f=1;
for(int a=-l;a<=l;++a){
for(int b=-l;b<=l;++b){
if(st[x-a*a*a-b*b*b]){
cout<<a<<" "<<b<<" "<<pow(x-a*a*a-b*b*b,(double)1/3)<<"\n";
f=0;
break;
}
}
if(!f)break;
}
if(f)cout<<l+1<<" "<<l+1<<" "<<l+1<<"\n";
}
return 0;
}
详细
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 20ms
memory: 4784kb
input:
98 10 5487 1899 3043 5373 2368 3993 723 9567 6812 901
output:
-46 -10 47 -77 44 72 -36 -29 42 -72 45 66 -12 0 16 -55 44 44 -77 58 64 -28 12 31 -66 27 65 -11 -8 14
result:
ok Correct!
Test #2:
score: 10
Accepted
time: 35ms
memory: 5820kb
input:
99 10 6139 3749 7532 3544 3976 345 522 8442 6400 7965
output:
100 100 100 100 100 100 -12 -1 21 -49 -40 57 -58 42 50 1 1 7 -11 5 12 -84 -47 89 -24 -12 28 -51 2 52
result:
ok Correct!
Test #3:
score: 10
Accepted
time: 35ms
memory: 5816kb
input:
98 10 5078 9597 9394 9368 8777 6955 8020 5115 398 3771
output:
99 99 99 99 99 99 2 5 21 -42 -12 44 -44 -15 46 -60 26 59 -9 -8 21 -14 10 19 -32 15 31 -18 14 19
result:
ok Correct!
Test #4:
score: 0
Time Limit Exceeded
input:
91 10000 163 6364 2583 7101 5320 483 6442 1028 1209 1710 5617 296 7228 1593 4580 5559 9699 2015 6397...
output:
-76 -68 91 -39 -24 43 -7 9 13 -27 -6 30 -84 36 82 -13 -4 14 92 92 92 -60 37 55 -11 7 13 -52 -35 57 -...
result:
Test #5:
score: 0
Time Limit Exceeded
input:
91 10000 6480 8776 1711 1745 4845 3338 343 3167 8450 2756 2252 4375 4912 9822 8053 1533 1216 4161 61...
output:
-84 -39 87 -77 61 62 -54 -33 58 -27 21 23 -20 13 22 -19 13 20 -91 7 91 -20 -10 23 -37 -6 39 6 7 13 9...
result:
Test #6:
score: 0
Time Limit Exceeded
input:
95 10000 91 6885 8279 384 5310 2877 4483 2176 267 393 5446 7415 3853 4223 8480 3368 6752 9898 5779 7...
output:
-5 0 6 -86 68 69 -58 -36 63 -52 -46 62 -11 12 17 2 5 14 -48 -26 51 -24 20 20 -10 -4 11 96 96 96 -42 ...
result:
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...
