oj.uz

Submission #150198

# Submission time Handle Problem Language Result Execution time Memory
150198 2019-09-01T07:52:43 Z 본인 하지만 안 어림 ㅋㅋ(#3569, gs13105, xdoju, gs13068) Wine Tasting (FXCUP4_wine) C++17
57 / 100
 11 ms 1036 KB 
#include <bits/stdc++.h>
using namespace std;

#include "bartender.h"

std::vector<int> BlendWines(int K, std::vector<int> R){

    int N = R.size();

    if(K < 11)
        return vector<int>(N, 1);

    vector<int> v;
    for(int i = 1; i <= 5; i++)
    {
        v.push_back(11 - i);
        for(int j = 0; j < 4; j++)
            v.push_back(i);
        v.push_back(11 - i);
    }

    vector<int> a(N);
    for(int i = 0; i < N; i++)
        a[i] = v[R[i] - 1];

	return a;
}

#include <bits/stdc++.h>
using namespace std;

#include "taster.h"

void jus(int x, int y, vector<int> &v)
{
    if(Compare(v[x], v[y]) == 1)
        swap(v[x], v[y]);
}

void sort4(vector<int> &v)
{
    assert((int)v.size() == 4);

    jus(0, 1, v);
    jus(2, 3, v);
    if(Compare(v[1], v[3]) == 1)
    {
        swap(v[1], v[3]);
        swap(v[0], v[2]);
    }
    jus(1, 2, v);
    jus(0, 1, v);
}

void sort3(vector<int> &v)
{
    assert((int)v.size() == 3);

    jus(0, 1, v);
    jus(1, 2, v);
    jus(0, 1, v);
}

void sort2(vector<int> &v)
{
    assert((int)v.size() == 2);

    jus(0, 1, v);
}

std::vector<int> SortWines(int K, std::vector<int> A) {
	int N = A.size();
	
    vector<int> r(N);

    if(K < 11)
    {
        for(int i = 0; i < N; i++)
            r[i] = i + 1;
        return r;
    }

    for(int i = 1; i <= 5; i++)
    {
        int p = 6 * i - 5;

        vector<int> x, y;
        for(int j = 0; j < N; j++)
        {
            if(A[j] == 11 - i)
                x.push_back(j);
            else if(A[j] == i)
                y.push_back(j);
        }

        if(x.empty())
        {
            assert(y.empty());
            continue;
        }

        if(x.size() == 2)
        {
            r[x[0]] = p;
            r[x[1]] = p + 5;
            if(Compare(x[0], y[0]) == 1)
                swap(r[x[0]], r[x[1]]);

            sort4(y);
            for(int j = 0; j < 4; j++)
                r[y[j]] = p + 1 + j;
        }
        else
        {
            assert((int)x.size() == 1);

            r[x[0]] = p;
            
            int sz = (int)y.size();
            if(sz == 4)
                sort4(y);
            else if(sz == 3)
                sort3(y);
            else if(sz == 2)
                sort2(y);

            for(int j = 0; j < sz; j++)
                r[y[j]] = p + 1 + j;
        }
    }

    return r;
}

Compilation message

bartender.cpp: In function 'std::vector<int> BlendWines(int, std::vector<int>)':
bartender.cpp:23:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(int i = 0; i < N; i++)
     ^~~
bartender.cpp:26:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  return a;
  ^~~~~~

Subtask #1
57.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 908 KB Correct
2 Correct 10 ms 908 KB Correct
3 Correct 9 ms 772 KB Correct
4 Correct 10 ms 788 KB Correct
5 Correct 8 ms 772 KB Correct
6 Correct 9 ms 888 KB Correct
7 Correct 10 ms 772 KB Correct
8 Correct 10 ms 908 KB Correct
9 Correct 9 ms 908 KB Correct
10 Correct 9 ms 780 KB Correct
11 Correct 10 ms 644 KB Correct
12 Correct 9 ms 644 KB Correct
13 Correct 8 ms 772 KB Correct
14 Correct 9 ms 772 KB Correct
15 Correct 11 ms 644 KB Correct
16 Correct 10 ms 772 KB Correct
17 Correct 10 ms 824 KB Correct
18 Correct 9 ms 692 KB Correct
19 Correct 11 ms 908 KB Correct
20 Correct 10 ms 884 KB Correct
21 Correct 9 ms 780 KB Correct
22 Correct 9 ms 908 KB Correct
23 Correct 9 ms 888 KB Correct
24 Correct 9 ms 908 KB Correct
25 Correct 9 ms 784 KB Correct
26 Correct 9 ms 908 KB Correct
27 Correct 10 ms 884 KB Correct
28 Correct 10 ms 980 KB Correct
29 Correct 10 ms 772 KB Correct
30 Correct 8 ms 772 KB Correct
31 Correct 9 ms 772 KB Correct
32 Correct 8 ms 776 KB Correct
33 Correct 9 ms 772 KB Correct
34 Correct 9 ms 772 KB Correct
35 Correct 9 ms 644 KB Correct
36 Correct 8 ms 772 KB Correct
37 Correct 8 ms 772 KB Correct
38 Correct 10 ms 908 KB Correct
39 Correct 10 ms 908 KB Correct
40 Correct 10 ms 772 KB Correct
41 Correct 10 ms 908 KB Correct
42 Correct 10 ms 996 KB Correct
43 Correct 10 ms 908 KB Correct
44 Correct 8 ms 780 KB Correct
45 Correct 10 ms 908 KB Correct
46 Correct 10 ms 908 KB Correct
47 Correct 10 ms 772 KB Correct
48 Correct 9 ms 772 KB Correct
49 Correct 9 ms 780 KB Correct
50 Correct 10 ms 908 KB Correct
51 Correct 9 ms 864 KB Correct
52 Correct 8 ms 780 KB Correct
53 Correct 9 ms 780 KB Correct
54 Correct 9 ms 772 KB Correct
55 Correct 9 ms 772 KB Correct
56 Correct 9 ms 908 KB Correct
57 Correct 9 ms 644 KB Correct
58 Correct 10 ms 656 KB Correct
59 Correct 10 ms 772 KB Correct
60 Correct 9 ms 1036 KB Correct
61 Correct 10 ms 772 KB Correct
62 Correct 9 ms 772 KB Correct
63 Correct 8 ms 772 KB Correct
64 Correct 9 ms 772 KB Correct
65 Correct 9 ms 788 KB Correct
66 Correct 9 ms 772 KB Correct
67 Correct 9 ms 644 KB Correct
68 Correct 9 ms 780 KB Correct
69 Correct 10 ms 908 KB Correct
70 Correct 9 ms 772 KB Correct
71 Correct 9 ms 908 KB Correct
72 Correct 10 ms 908 KB Correct
73 Partially correct 10 ms 772 KB Wrong
74 Partially correct 8 ms 644 KB Wrong
75 Partially correct 10 ms 908 KB Wrong
76 Correct 9 ms 772 KB Correct
77 Partially correct 10 ms 656 KB Wrong
78 Partially correct 9 ms 772 KB Wrong
79 Partially correct 10 ms 820 KB Wrong
80 Partially correct 8 ms 884 KB Wrong
81 Partially correct 10 ms 780 KB Wrong
82 Partially correct 9 ms 772 KB Wrong
83 Partially correct 10 ms 772 KB Wrong
84 Partially correct 8 ms 772 KB Wrong
85 Partially correct 10 ms 780 KB Wrong
86 Partially correct 10 ms 880 KB Wrong
87 Correct 9 ms 908 KB Correct
88 Correct 9 ms 644 KB Correct
89 Partially correct 9 ms 772 KB Wrong
90 Partially correct 10 ms 732 KB Wrong
91 Partially correct 10 ms 772 KB Wrong
92 Partially correct 9 ms 772 KB Wrong
93 Partially correct 10 ms 692 KB Wrong
94 Partially correct 9 ms 908 KB Wrong
95 Partially correct 10 ms 908 KB Wrong
96 Partially correct 9 ms 908 KB Wrong
97 Partially correct 9 ms 772 KB Wrong
98 Partially correct 9 ms 908 KB Wrong
99 Partially correct 8 ms 644 KB Wrong
100 Partially correct 10 ms 868 KB Wrong
101 Partially correct 10 ms 908 KB Wrong
102 Correct 10 ms 968 KB Correct
103 Correct 10 ms 908 KB Correct
104 Partially correct 9 ms 772 KB Wrong
105 Partially correct 9 ms 732 KB Wrong
106 Partially correct 10 ms 780 KB Wrong
107 Partially correct 10 ms 772 KB Wrong
108 Partially correct 9 ms 772 KB Wrong
109 Partially correct 9 ms 644 KB Wrong
110 Partially correct 9 ms 772 KB Wrong
111 Partially correct 8 ms 772 KB Wrong
112 Partially correct 8 ms 780 KB Wrong
113 Partially correct 10 ms 772 KB Wrong
114 Partially correct 9 ms 772 KB Wrong
115 Partially correct 8 ms 908 KB Wrong
116 Partially correct 10 ms 772 KB Wrong
117 Correct 8 ms 1020 KB Correct
118 Partially correct 8 ms 788 KB Wrong
119 Partially correct 9 ms 732 KB Wrong
120 Partially correct 10 ms 804 KB Wrong