QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#169165#7109. Traveling on the AxisTjan#AC ✓8ms5424kbC++171.3kb2023-09-09 13:09:262023-09-09 13:09:27

Judging History

你现在查看的是最新测评结果

  • [2023-09-09 13:09:27]
  • 评测
  • 测评结果:AC
  • 用时:8ms
  • 内存:5424kb
  • [2023-09-09 13:09:26]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
#define ll long long
#define wln putchar('\n')
template<class T1,class T2> void chkmin(T1 &x,T2 y){if(y<x)x=y;}
template<class T1,class T2> void chkmax(T1 &x,T2 y){if(y>x)x=y;}
#define maxn 100005
#define mod 256

int T;
int n;
char s[maxn];
int op[maxn];
int tim[maxn];
ll sm[maxn];

void init()
{
    For(i, 1, n) op[i] = tim[i] = sm[i] = 0;
}
void Main()
{
    scanf("%s", s + 1);
    n = strlen(s + 1);
    For(i, 1, n) op[i] = (s[i] - '0') ^ 1;
    For(nw, 1, n) {
        if(tim[nw - 1] % 2 == op[nw]) tim[nw] = tim[nw - 1] + 1;
        else tim[nw] = tim[nw - 1] + 2;
    }
    For(i, 1, n) sm[i] = sm[i - 1] + tim[i];
    ll ans = sm[n];
    For(i, 1, n - 1) {
        if(tim[i] % 2 == 0) {
            ans = ans + sm[n] - sm[i] - 1ll * (n - i) * tim[i];
        }
        else {
            if(op[i + 1] % 2 == 0) {
                ans = ans + sm[n] - sm[i] - 1ll * (n - i) * tim[i] - (n - i);
            }
            else {
                ans = ans + sm[n] - sm[i] - 1ll * (n - i) * tim[i] + (n - i);
            }
        }
    }
    printf("%lld\n", ans);
}
int main()
{
    scanf("%d", &T);
    while(T--) Main();
    return 0;
}
/*
3
101
011
11010

*/

这程序好像有点Bug,我给组数据试试?

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3844kb

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 8ms
memory: 5424kb

input:

6107
1010101
010110100110101
1010
1010101010010101010
101011
0101101011010101010
0101101011
11011010101
010
1011010
10110101010101010100
010101010110101
10101010101011
0101010101010101011
00101010011000
1010101010010110110
01010101001010101010
101010101010101
100100101010101010
01
011
0101010100101
...

output:

96
889
24
1515
69
1567
279
345
14
106
1702
791
621
1447
764
1615
1755
736
1333
6
15
542
44
1689
1515
140
833
497
596
24
1640
694
462
30
425
14
1041
1446
96
504
124
75
560
970
771
945
6
1
321
137
786
720
206
769
46
103
225
74
554
2
100
529
260
207
197
2
197
1041
140
857
207
1
74
1604
41
343
1041
14
1...

result:

ok 6107 lines

Extra Test:

score: 0
Extra Test Passed