QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#614602#5420. Inscryptionucup-team1769#WA 134ms3548kbC++201.8kb2024-10-05 16:39:342024-10-05 16:39:35

Judging History

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

  • [2024-10-05 16:39:35]
  • 评测
  • 测评结果:WA
  • 用时:134ms
  • 内存:3548kb
  • [2024-10-05 16:39:34]
  • 提交

answer

#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
using namespace std;
typedef pair<int, int> pii;
const int maxn = 1e6;
signed main()
{
    IOS;
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        vector<int> v(n + 1);
        for (int i = 0; i < n; i++)
            cin >> v[i];
        int fz = 1, fm = 1, ff = 1;
        for (int i = 0; i < n; i++)
        {
            if (v[i] == 1 || v[i] == 0)
            {
                fz++;
                fm++;
            }
            else
            {
                fm--;
                if (fm < 1)
                    ff = 0;
            }
        }
        int fm1 = fm, fz1 = fz;
        if (!ff)
        {
            cout << "-1\n";
        }
        else
        {
            int cnt = 0;
            for (int i = n - 1; i >= 0; i--)
            {
                if (v[i] == 1)
                {
                    if (cnt)
                        cnt--;
                    fz1--;
                    fm1--;
                }
                else if (v[i] == -1)
                {
                    cnt++;
                    fm1++;
                }
                else
                {
                    if (fm > cnt + 2 && fm1 > cnt + 2)
                    {
                        cnt++;
                        fz -= 1;
                        fm -= 2;
                        fz1 -= 1;
                        fm1 -= 2;
                    }
                    else
                        cnt--;
                }
            }

            int _ = gcd(fz, fm);
            cout << fz / _ << " " << fm / _ << endl;
        }
    }
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3548kb

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: 134ms
memory: 3492kb

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: -100
Wrong Answer
time: 64ms
memory: 3540kb

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
7 3
3 2
3 1
3 2
-1
-1
-1
-1
2 1
5 3
-1
5 4
2 1
-1
3 2
2 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
4 1
1 1
2 1
5 2
-1
3 1
4 3...

result:

wrong answer 17th lines differ - expected: '6 1', found: '7 3'