QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#105194 | #6395. Equation Discovering | Sommohito# | ML | 14ms | 20336kb | C++20 | 4.2kb | 2023-05-13 16:03:09 | 2023-05-13 16:03:10 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#ifdef APURBA
#include "DEBUG_TEMPLATE.h"
#else
#define HERE
#define debug(args...)
#endif
#define ALL(x) x.begin(),x.end()
const int N = 2e5 +5;
typedef pair<int,int> pii;
//int cnt(int comp)
//{
// ll ans=0;
//
// if(comp-2>=0)
// {
// int baki=comp-2;
// for(int l=0;l<=baki;l++)
// {
// int L=cnt(l);
// int R=cnt(baki-l);
// ans+=L*R*4;
// }
// }
// if(comp-1>=0)
// {
// ans+=cnt(comp-1)*2;
// }
// ans++;
//
// return ans;
//}
vector<ld> x,y;
vector<pair<vector<ld>,string>> save[10];
int dp[10];
int n;
vector<pair<vector<ld>,string>> cnt(int comp)
{
if(dp[comp])
return save[comp];
dp[comp]=true;
vector<pair<vector<ld>,string>> ans;
if(comp-2>=0)
{
int baki=comp-2;
for(int l=0; l<=baki; l++)
{
auto L=cnt(l);
auto R=cnt(baki-l);
for(auto l:L)
{
for(auto r:R)
{
{
pair<vector<ld>,string> notun;
notun.first.resize(n);
notun.second="("+l.second+"+"+r.second+")";
for(int i=0; i<n; i++)
notun.first[i]=l.first[i]+r.first[i];
ans.push_back(notun);
}
{
pair<vector<ld>,string> notun;
notun.first.resize(n);
notun.second="("+l.second+"-"+r.second+")";
for(int i=0; i<n; i++)
notun.first[i]=l.first[i]-r.first[i];
ans.push_back(notun);
}
{
pair<vector<ld>,string> notun;
notun.first.resize(n);
notun.second="("+l.second+"*"+r.second+")";
for(int i=0; i<n; i++)
notun.first[i]=l.first[i]*r.first[i];
ans.push_back(notun);
}
{
pair<vector<ld>,string> notun;
notun.first.resize(n);
notun.second="("+l.second+"/"+r.second+")";
bool f=1;
for(int i=0; i<n; i++)
{
if(abs(r.first[i])<0.01) f=0;
notun.first[i]=l.first[i]/r.first[i];
}
if(f)
ans.push_back(notun);
}
}
}
}
}
if(comp-1>=0)
{
auto L=cnt(comp-1);
for(auto l:L)
{
{
pair<vector<ld>,string> notun;
notun.first.resize(n);
notun.second="(sin("+l.second+"))";
for(int i=0; i<n; i++)
notun.first[i]=sin(l.first[i]);
ans.push_back(notun);
}
{
pair<vector<ld>,string> notun;
notun.first.resize(n);
notun.second="(cos("+l.second+"))";
for(int i=0; i<n; i++)
notun.first[i]=cos(l.first[i]);
ans.push_back(notun);
}
}
}
ans.push_back({x,"x"});
return save[comp]=ans;
}
void TEST_CASES()
{
cin>>n;
x.resize(n);
y.resize(n);
for(int i=0; i<n; i++)
cin>>x[i]>>y[i];
for(int comp=0;comp<=9;comp++)
{
auto got=cnt(comp);
for(auto r:got)
{
bool f=1;
for(int i=0;i<n;i++)
{
if(abs(y[i]-r.first[i])>=1e-3)
f=0;
}
if(f)
{
cout<<r.second;
exit(0);
}
}
}
}
/*
*/
int32_t main()
{
#ifndef APURBA
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
#endif
//freopen("input.txt","r",stdin);
//freopen("out1.txt","w",stdout);
int t=1;
//cin>>t;
while(t--)
{
TEST_CASES();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 2ms
memory: 3528kb
input:
3 1.000000 1.000000 2.000000 4.000000 3.000000 9.000000
output:
(x*x)
result:
ok great!!
Test #2:
score: 0
Accepted
time: 1ms
memory: 4040kb
input:
3 0.618000 1.517072 0.314000 3.132637 1.414000 0.494016
output:
((sin(x))/(x*x))
result:
ok great!!
Test #3:
score: 0
Accepted
time: 2ms
memory: 3632kb
input:
5 77.685777 233.057331 -66.445083 -199.335249 79.966717 239.900151 84.982130 254.946390 -31.528900 -94.586700
output:
(x+(x+x))
result:
ok great!!
Test #4:
score: 0
Accepted
time: 2ms
memory: 3764kb
input:
5 25.032427 -0.100652 38.727324 1.658518 27.684334 -0.669555 64.282391 8.275303 52.640700 -0.962660
output:
((sin(x))/(cos(x)))
result:
ok great!!
Test #5:
score: 0
Accepted
time: 14ms
memory: 20336kb
input:
5 78.611917 -0.992212 -29.857271 1.011993 -75.513655 1.006611 68.512394 1.145128 7.961096 0.881661
output:
((cos(x))+((sin(x))*(sin(x))))
result:
ok great!!
Test #6:
score: 0
Accepted
time: 2ms
memory: 3736kb
input:
5 -78.733375 0.503570 -20.187183 0.735779 -38.984992 0.730890 47.859232 0.622831 -19.657164 0.641512
output:
(sin((sin((cos((cos(x))))))))
result:
ok great!!
Test #7:
score: 0
Accepted
time: 2ms
memory: 3548kb
input:
5 3.241091 -32.628130 -83.514144 86.463432 33.586619 40.691607 41.123543 -147.352644 26.896326 27.404018
output:
(x/(sin(x)))
result:
ok great!!
Test #8:
score: -100
Memory Limit Exceeded
input:
20 -4.908422 -0.693287 3.569189 0.328182 1.946572 -0.667466 6.515336 -0.829948 -1.394076 0.752980 6.722989 0.831881 1.241795 0.835231 -2.443177 -0.143098 -4.180762 -0.803482 1.511247 0.589509 0.627755 0.554244 -1.865604 -0.470029 -4.756347 -0.656984 1.850611 -0.426016 6.580133 -0.474416 6.861815 -0....