oj.uz

답안 #368236

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
368236 2021-02-19T20:04:50 Z Vimmer Tenis (COCI20_tenis) C++14
50 / 110
 1000 ms 1644 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("-O3")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("Ofast")

#define N 100501
#define NN 1000500
#define PB push_back
#define M ll(1e9 + 7)
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size())
#define _ << " " <<
#define pri(x) cout << x << endl
#define endl '\n'
#define F first
#define S second

//using namespace __gnu_pbds;
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef long double ld;

//typedef tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int pos[3][N], ans[N], kol[3], X, Y;

bool cmp(int l, int r)
{
    int L, R;

    if (pos[l][X] > pos[l][Y])
        L = pos[l][X];
            else L = pos[l][Y];

    if (pos[r][X] > pos[r][Y])
        R = pos[r][X];
            else R = pos[r][Y];

    if (L == R) return l < r;

    return L < R;
}

int main()
{
    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//    freopen("1.in", "r", stdin);
//
//    freopen("pixels.in", "r", stdin);
//    freopen("pixels.out", "w", stdout);

    int n;

    cin >> n;

    for (int i = 0; i < 3; i++)
        for (int j = 0; j < n; j++)
        {
            int x;

            cin >> x;

            x--;

            pos[i][x] = j;
        }

    for (int i = 0; i < n; i++)
        for (int j = i + 1; j < n; j++)
        {
            X = i;
            Y = j;

            multiset <int> se; se.clear();

            for (int t = 0; t < 3; t++)
            {
                if (pos[t][i] > pos[t][j])
                    se.insert(pos[t][j]);
                        else se.insert(pos[t][i]);
            }

            vector <int> who; who.clear();

            int x = *se.begin();

            for (int t = 0; t < 3; t++)
            {
                if (pos[t][i] == x && pos[t][i] < pos[t][j])
                {
                    who.PB(t);
                }

                if (pos[t][j] == x && pos[t][j] < pos[t][i])
                {
                    who.PB(t);
                }
            }

            sort(all(who), cmp);

            int t = who[0];

            kol[t]++;

            if (pos[t][i] > pos[t][j])
                ans[j]++;
                    else ans[i]++;
        }

    for (int i = 0; i < 3; i++) cout << kol[i] << " ";

    cout << endl;

    for (int i = 0; i < n; i++) cout << ans[i] << " ";
}

Subtask #1
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 8 ms 364 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 8 ms 364 KB Output is correct
4 Correct 718 ms 504 KB Output is correct

Subtask #3
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 8 ms 364 KB Output is correct
4 Correct 718 ms 504 KB Output is correct
5 Execution timed out 1078 ms 1644 KB Time limit exceeded
6 Halted 0 ms 0 KB -