oj.uz

Submission #368206

# Submission time Handle Problem Language Result Execution time Memory
368206 2021-02-19T19:07:30 Z Vimmer Tenis (COCI20_tenis) C++14
0 / 110
 7 ms 364 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];

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++)
        {
            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]);
            }

            int x = *se.begin();

            auto it = se.begin();

            it++;

            if (*it != x)
            {
                for (int t = 0; t < 3; t++)
                {
                    if (pos[t][i] == x && pos[t][i] < pos[t][j])
                    {
                        kol[t]++;

                        ans[i]++;

                        break;
                    }

                    if (pos[t][j] == x && pos[t][j] < pos[t][i])
                    {
                        kol[t]++;

                        ans[j]++;

                        break;
                    }
                }
            }
            else
            {
                se.clear();

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

                int x = *se.begin();

                for (int t = 0; t < 3; t++)
                {
                    if (pos[t][i] == x && pos[t][i] > pos[t][j])
                    {
                        kol[t]++;

                        ans[j]++;

                        break;
                    }

                    if (pos[t][j] == x && pos[t][j] > pos[t][i])
                    {
                        kol[t]++;

                        ans[i]++;

                        break;
                    }
                }
            }
        }

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

    cout << endl;

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

Subtask #1
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Partially correct 1 ms 364 KB Partially correct
3 Incorrect 7 ms 364 KB Output isn't correct

Subtask #2
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Partially correct 1 ms 364 KB Partially correct
3 Incorrect 7 ms 364 KB Output isn't correct

Subtask #3
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Partially correct 1 ms 364 KB Partially correct
3 Incorrect 7 ms 364 KB Output isn't correct