QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #572439 | #9255. Python Program | lonlyness | TL | 0ms | 3680kb | C++23 | 5.8kb | 2024-09-18 14:31:43 | 2024-09-18 14:31:44 |
Judging History
answer
// _ _ _
// | | ___ _ __ ___ | | (_) _ __ ___ ___ ___
// | | / _ \ | '_ \ / _ \ | | | | | '_ \ / _ \ / __| / __|
// | | | (_) | | | | | | __/ | | | | | | | | | __/ \__ \ \__ \
// |_| \___/ |_| |_| \___| |_| |_| |_| |_| \___| |___/ |___/
//
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<cmath>
#include<unordered_map>
using namespace std;
#define int long long
#define endl "\n"
const int N=1e5+10;
typedef pair<int,int> PII;
int k;
int get(string s){
int res = 0;
bool flag = 1;
for(int i= 0;i < s.size();i ++){
if(s[i]=='-'){
flag = 0;
continue;
}
res = res*10+s[i]-'0';
}
if(!flag)res=-res;
return res;
}
void solve()
{
string s[100];
int idx = 0;
string n,m;
cin>>s[idx++];
cin>>s[idx++];
cin>>n;
cin>>s[idx++];
cin>>s[idx++];
string a,b,c,d,e,f;
for(int i= 0;i < s[idx-1].size();i ++){
if(s[idx-1][i]=='('){
int j =i+1;
// cout<<i<<' '<<j<<endl;
while(j< s[idx-1].size()&&s[idx-1][j]!=','&&s[idx-1][j]!=')'){
a+=s[idx-1][j];
j++;
}
// cout<<i<<' '<<j<<endl;
i = j;
j++;
while(j< s[idx-1].size()&&s[idx-1][j]!=','&&s[idx-1][j]!=')'){
b+=s[idx-1][j];
j++;
if(s[idx-1][j]==')')break;
}
if(s[idx-1][j]==')')break;
j++;
i = j;
// cout<<j<<endl;
while(j< s[idx-1].size()&&s[idx-1][j]!=','&&s[idx-1][j]!=')'){
c+=s[idx-1][j];
j++;
}
}
}
cin>>s[idx++];
cin>>s[idx++];
cin>>s[idx++];
cin>>s[idx++];
for(int i= 0;i < s[idx-1].size();i ++){
if(s[idx-1][i]=='('){
int j =i+1;
// cout<<i<<' '<<j<<endl;
while(j< s[idx-1].size()&&s[idx-1][j]!=','&&s[idx-1][j]!=')'){
d+=s[idx-1][j];
j++;
}
// cout<<i<<' '<<j<<endl;
i = j;
j++;
while(j< s[idx-1].size()&&s[idx-1][j]!=','&&s[idx-1][j]!=')'){
e+=s[idx-1][j];
j++;
if(s[idx-1][j]==')')break;
}
if(s[idx-1][j]==')')break;
j++;
i = j;
while(j< s[idx-1].size()&&s[idx-1][j]!=','&&s[idx-1][j]!=')'){
f+=s[idx-1][j];
j++;
}
}
}
// cout<<a<<' '<<b<<' '<<c<<' '<<d<<' '<<e<<' '<<f<<endl;
int ans = 0;
if(c.empty()){
if(f.empty()){
for(int i= get(a);i<get(b);i ++){
int d1,e1;
if(d==n)d1=i;
else d1=get(d);
if(e==n)e1=i;
else e1=get(e);
for(int j = d1;j < e1;j ++)ans+=j;
}
}
else {
for(int i= get(a);i<get(b);i ++){
int d1,e1,f1;
if(d==n)d1=i;
else d1=get(d);
if(e==n)e1=i;
else e1=get(e);
if(f==n)f1=i;
else f1=get(f);
// cout<<d1<<' '<<e1<<' '<<f1<<endl;
if(f1>0)
for(int j = d1;j < e1;j +=f1)ans+=j;
else
for(int j = d1;j > e1;j +=f1)ans+=j;
}
}
}
else {
if(f.empty()){
if(get(c)>0){
for(int i= get(a);i<get(b);i +=get(c)){
int d1,e1;
if(d==n)d1=i;
else d1=get(d);
if(e==n)e1=i;
else e1=get(e);
for(int j = d1;j < e1;j ++)ans+=j;
}
}
else {
for(int i= get(a);i>get(b);i +=get(c)){
int d1,e1;
if(d==n)d1=i;
else d1=get(d);
if(e==n)e1=i;
else e1=get(e);
for(int j = d1;j < e1;j ++)ans+=j;
}
}
}
else {
if(get(c)>0){
for(int i= get(a);i<get(b);i +=get(c)){
int d1,e1,f1;
if(d==n)d1=i;
else d1=get(d);
if(e==n)e1=i;
else e1=get(e);
if(f==n)f1=i;
else f1=get(f);
if(f1>0)
for(int j = d1;j < e1;j +=f1)ans+=j;
else
for(int j = d1;j > e1;j +=f1)ans+=j;
}
}
else {
for(int i= get(a);i>get(b);i +=get(c)){
int d1,e1,f1;
if(d==n)d1=i;
else d1=get(d);
if(e==n)e1=i;
else e1=get(e);
if(f==n)f1=i;
else f1=get(f);
if(f1>0)
for(int j = d1;j < e1;j +=f1)ans+=j;
else
for(int j = d1;j > e1;j +=f1)ans+=j;
}
}
}
}
cout<<ans<<endl;
}
signed main()
{
ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3656kb
input:
ans=0
for a in range(1,3):
for b in range(5,1,-2):
ans+=b
print(ans)
output:
16
result:
ok single line: '16'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
ans=0
for q in range(100,50,-1):
for i in range(q,77,20):
ans+=i
print(ans)
output:
2092
result:
ok single line: '2092'
Test #3:
score: -100
Time Limit Exceeded
input:
ans=0
for i in range(1,1000000):
for j in range(i,1,-1):
ans+=j
print(ans)