QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #725011 | #5420. Inscryption | hellocccl | TL | 217ms | 3740kb | C++20 | 1.1kb | 2024-11-08 15:53:33 | 2024-11-08 15:53:33 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
// #define int long long
const int N=2e6+7;
map<int,vector<pair<int,int>>>mp;
int a[N];
void solve(){
mp.clear();
int n;cin>>n;
mp[0].push_back({1,1});
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
int x;x=a[i];
if(x==1){
auto &c=mp[i-1];
for(auto &[a,b]:c){
mp[i].push_back({a+1,b+1});
}
}else if(x==-1){
auto &c=mp[i-1];
for(auto &[a,b]:c){
if(b-1==0)continue;
mp[i].push_back({a,b-1});
}
if(mp[i].size()==0){
cout<<-1<<'\n';
return;
}
}else{
auto &c=mp[i-1];
for(auto &[a,b]:c){
if(b-1>0)
mp[i].push_back({a,b-1});
mp[i].push_back({a+1,b+1});
}
}
}
auto &c=mp[n];
int ansx,ansy;
double ans=-1;
for(auto &[a,b]:c){
if((double)a*1.0/b>ans){
ans=(double)a*1.0/b;
ansx=a;
ansy=b;
}
}
int g=__gcd(ansx,ansy);
cout<<ansx/g<<" "<<ansy/g<<'\n';
}
signed main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int _=1;
cin>>_;
while(_--)solve();
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3652kb
input:
6 7 1 1 1 -1 1 1 -1 4 1 0 -1 0 4 0 -1 -1 0 1 0 2 0 0 1 -1
output:
3 2 3 1 -1 1 1 2 1 -1
result:
ok 6 lines
Test #2:
score: 0
Accepted
time: 217ms
memory: 3668kb
input:
1000000 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 1 -1 1 0 1 0 1 1 1 0 1 -1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 0 1 0 1 1 1 -1 1 1 1 1 1 -1 1 0 1 1 1 0 1 -1 1 0 1 -1 1 1 1 -1 1 0 1 1 1 1 1 -1 1 0 1 -1 1 -1 1 -1 1 -1 1 0 1 0 1 -1 1 0 1 -1 1 0 1 0 1 0 1 0 1 0 1 -1 1 1 1 0 1 0 1 1 1 0 1 -1 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 ...
output:
1 1 -1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 -1 1 1 1 1 1 1 -1 1 1 -1 1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 ...
result:
ok 1000000 lines
Test #3:
score: 0
Accepted
time: 122ms
memory: 3740kb
input:
181249 6 1 0 -1 0 1 0 4 1 -1 -1 -1 8 -1 0 0 0 1 -1 1 1 3 0 1 0 6 1 0 -1 1 -1 0 4 1 -1 -1 -1 9 0 1 0 -1 -1 0 -1 0 1 1 -1 3 0 -1 1 5 0 0 1 -1 1 3 1 -1 0 6 -1 0 0 -1 0 1 8 1 -1 -1 -1 0 1 -1 0 2 0 0 3 -1 1 0 3 0 -1 -1 10 0 1 0 -1 1 1 0 -1 1 0 3 1 0 0 9 1 -1 1 -1 0 -1 0 0 0 3 0 1 0 3 -1 0 0 7 -1 0 -1 -1 ...
output:
4 1 -1 -1 3 2 4 1 -1 3 1 -1 3 2 2 1 3 2 -1 -1 2 1 -1 -1 6 1 3 2 3 1 3 2 -1 -1 -1 -1 2 1 5 3 -1 5 4 2 1 -1 3 2 5 1 1 1 -1 3 2 -1 1 1 -1 2 1 1 1 -1 1 1 -1 1 1 3 2 -1 -1 -1 -1 3 2 5 2 1 1 -1 3 1 -1 -1 1 1 -1 6 1 3 2 -1 3 2 4 3 2 1 -1 5 3 3 1 6 1 -1 2 1 5 4 -1 1 1 -1 3 1 -1 -1 5 3 1 1 2 1 5 2 -1 3 1 4 3...
result:
ok 181249 lines
Test #4:
score: -100
Time Limit Exceeded
input:
19793 93 1 -1 1 1 -1 -1 1 0 0 0 0 1 1 -1 -1 -1 0 -1 -1 1 -1 0 0 0 0 1 0 -1 -1 1 -1 1 -1 1 -1 1 1 -1 1 0 1 0 -1 -1 0 1 1 0 -1 -1 0 1 1 0 -1 1 -1 -1 -1 0 0 0 1 -1 0 1 -1 0 0 0 1 0 -1 1 -1 -1 1 -1 0 1 -1 0 -1 -1 1 0 0 0 0 0 0 -1 -1 36 0 1 1 -1 1 -1 0 1 1 1 0 -1 1 1 -1 0 1 1 1 1 0 1 -1 -1 1 -1 1 0 -1 0 ...