QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#497738#6434. Paimon SortingbuzhijingdiTL 1ms3764kbC++141.3kb2024-07-29 16:43:212024-07-29 16:43:24

Judging History

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

  • [2024-07-29 16:43:24]
  • 评测
  • 测评结果:TL
  • 用时:1ms
  • 内存:3764kb
  • [2024-07-29 16:43:21]
  • 提交

answer

#include <iostream>
#include <vector>

using namespace std;

int n;
vector<int>a(20050, 0);

int ppt(int nn)
{
        int num = 0;
        vector<int> tt(a.begin(), a.end());
        for (int i = 1; i <= nn; i++)
        {
                for (int j = 1; j <= nn; j++)
                        if (tt[i] < tt[j])
                        {
                                num++;
                                swap(tt[i], tt[j]);
                        }
        }
        return num;
}

int main(void)
{
        int nnt;
        cin >> nnt;
        while (nnt--)
        {
                int n;
                cin >> n;

                for (int i = 1; i <= n; i++)
                {
                        cin >> a[i];
                }

                for (int i = 1; i < n; i++)
                {
                        cout << ppt(i) << " ";
                }
                cout << ppt(n);
                cout << endl;
        }
/*
        for (int i = 1; i <= n; i++)
        {
                for (int j = 1; j <= n; j++)
                        if (a[i] < a[j])
                        {
                                cout << i << " " << j << endl;
                                swap(a[i], a[j]);
                        }
                cout << endl;
        }
*/
        return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
5
2 3 2 1 5
3
1 2 3
1
1

output:

0 2 3 5 7
0 2 4
0

result:

ok 3 lines

Test #2:

score: -100
Time Limit Exceeded

input:

6107
19
10 13 8 8 11 18 12 9 15 19 6 13 11 11 17 9 14 2 18
12
1 8 10 2 10 2 6 1 5 9 5 7
16
14 4 2 15 12 14 10 3 2 9 15 4 12 9 5 15
10
3 2 5 6 7 8 6 1 6 4
18
6 5 12 12 11 2 10 10 5 10 13 15 13 10 17 7 11 2
1
1
2
1 1
3
2 1 2
17
11 15 3 10 7 15 15 10 5 17 3 3 14 13 11 11 2
3
2 2 3
7
6 1 7 5 3 5 1
7
2 1...

output:

0 2 4 6 7 9 11 16 17 19 28 31 36 41 43 51 55 67 68
0 2 4 6 6 8 10 14 17 18 22 25
0 1 3 5 7 8 11 16 22 26 26 31 33 37 42 42
0 1 3 5 7 9 11 17 19 23
0 1 3 3 4 8 10 12 16 18 27 29 30 34 36 42 46 55
0
0 0
0 1 1
0 2 4 6 9 9 9 11 15 21 27 33 35 38 42 46 55
0 0 3
0 1 3 5 8 10 14
0 1 3 4 6 9 9
0 1 1 3 7 11 ...

result: