oj.uz

답안 #247139

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
247139 2020-07-11T06:39:43 Z dwsc 포도주 시음 (FXCUP4_wine) C++17
57 / 100
 11 ms 1208 KB 
#include <bits/stdc++.h>
#include "bartender.h"
using namespace std;
std::vector<int> BlendWines(int K, std::vector<int> R){
    int n = R.size();
    vector<int> v(n,0);
    for (int i = 0; i < n; i++){
        int bracket = (R[i]+5)/6;
        if (R[i]%2 == 0) v[i] = 11-bracket;
        else v[i] = bracket;
        //cout << v[i] << "\n";
    }
    return v;
}
#include <bits/stdc++.h>
#include "taster.h"
using namespace std;
vector<int> pos[11];
vector<int> ans;
void solve(int a){
    vector<int> temp;
    int tot = pos[a].size()+pos[11-a].size();
    if (tot == 0) return;
    else if (tot == 1){
        temp.push_back(pos[a][0]);
    }
    else if (tot == 2){
        temp.push_back(pos[a][0]);
        temp.push_back(pos[11-a][0]);
    }
    else if (tot == 3){
        temp.push_back(pos[a][0]);
        temp.push_back(pos[11-a][0]);
        temp.push_back(pos[a][1]);
        if (Compare(temp[0],temp[2]) != -1) swap(temp[0],temp[2]);
    }
    else if (tot == 4){
        temp.push_back(pos[a][0]);
        temp.push_back(pos[11-a][0]);
        temp.push_back(pos[a][1]);
        temp.push_back(pos[11-a][1]);
        if (Compare(temp[0],temp[2]) != -1) swap(temp[0],temp[2]);
        if (Compare(temp[1],temp[2]) != -1) swap(temp[1],temp[3]);
    }
    else if (tot == 5){
        temp.push_back(pos[a][0]);
        temp.push_back(pos[11-a][0]);
        temp.push_back(pos[a][1]);
        temp.push_back(pos[11-a][1]);
        temp.push_back(pos[a][2]);
        if (Compare(temp[2],temp[4]) != -1) swap(temp[2],temp[4]);
        if (Compare(temp[0],temp[2]) != -1) swap(temp[0],temp[2]);
        if (Compare(temp[2],temp[4]) != -1) swap(temp[2],temp[4]);
        if (Compare(temp[1],temp[2]) != -1) swap(temp[1],temp[3]);
    }
    else if (tot == 6){
        temp.push_back(pos[a][0]);
        temp.push_back(pos[11-a][0]);
        temp.push_back(pos[a][1]);
        temp.push_back(pos[11-a][1]);
        temp.push_back(pos[a][2]);
        temp.push_back(pos[11-a][2]);
        if (Compare(temp[2],temp[4]) != -1) swap(temp[2],temp[4]);
        if (Compare(temp[0],temp[2]) != -1) swap(temp[0],temp[2]);
        if (Compare(temp[2],temp[4]) != -1) swap(temp[2],temp[4]);
        int val1 = Compare(temp[1],temp[4]),val2 = Compare(temp[3],temp[4]);
        if (val1 != -1) swap(temp[1],temp[5]);
        else if (val2 != -1) swap(temp[3],temp[5]);
        if (Compare(temp[1],temp[2]) != -1) swap(temp[1],temp[3]);
    }
    for (int i = 0; i < temp.size(); i++){
        ans[temp[i]] = (a-1)*6+i+1;
    }
    return;
}
std::vector<int> SortWines(int K, std::vector<int> A) {
    int n = A.size();
    for (int i = 0; i < n; i++) ans.push_back(i);
    for (int i = 0; i < n; i++){
        //cout << A[i] << "\n";
        pos[A[i]].push_back(i);
    }
    for (int i = 1; i <= 5; i++) solve(i);
    return ans;
}

Compilation message

taster.cpp: In function 'void solve(int)':
taster.cpp:57:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < temp.size(); i++){
                     ~~^~~~~~~~~~~~~

Subtask #1
57.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1008 KB Correct
2 Correct 9 ms 780 KB Correct
3 Correct 9 ms 788 KB Correct
4 Correct 8 ms 792 KB Correct
5 Correct 10 ms 784 KB Correct
6 Correct 9 ms 904 KB Correct
7 Correct 10 ms 776 KB Correct
8 Correct 8 ms 772 KB Correct
9 Correct 9 ms 792 KB Correct
10 Correct 10 ms 912 KB Correct
11 Correct 9 ms 792 KB Correct
12 Correct 10 ms 780 KB Correct
13 Correct 8 ms 780 KB Correct
14 Correct 10 ms 784 KB Correct
15 Correct 8 ms 784 KB Correct
16 Correct 9 ms 772 KB Correct
17 Correct 9 ms 792 KB Correct
18 Correct 8 ms 788 KB Correct
19 Correct 9 ms 776 KB Correct
20 Correct 8 ms 784 KB Correct
21 Correct 9 ms 1024 KB Correct
22 Correct 9 ms 788 KB Correct
23 Correct 9 ms 1012 KB Correct
24 Correct 9 ms 1012 KB Correct
25 Correct 9 ms 784 KB Correct
26 Correct 8 ms 780 KB Correct
27 Correct 9 ms 788 KB Correct
28 Correct 9 ms 780 KB Correct
29 Correct 10 ms 792 KB Correct
30 Correct 8 ms 784 KB Correct
31 Correct 8 ms 772 KB Correct
32 Correct 8 ms 780 KB Correct
33 Correct 8 ms 784 KB Correct
34 Correct 8 ms 784 KB Correct
35 Correct 8 ms 884 KB Correct
36 Correct 9 ms 1012 KB Correct
37 Correct 10 ms 780 KB Correct
38 Correct 8 ms 788 KB Correct
39 Correct 8 ms 788 KB Correct
40 Correct 9 ms 784 KB Correct
41 Correct 8 ms 784 KB Correct
42 Correct 8 ms 788 KB Correct
43 Correct 8 ms 792 KB Correct
44 Correct 9 ms 788 KB Correct
45 Correct 8 ms 780 KB Correct
46 Correct 10 ms 772 KB Correct
47 Correct 9 ms 644 KB Correct
48 Correct 8 ms 788 KB Correct
49 Correct 9 ms 784 KB Correct
50 Correct 8 ms 788 KB Correct
51 Correct 9 ms 792 KB Correct
52 Correct 8 ms 772 KB Correct
53 Correct 9 ms 784 KB Correct
54 Correct 9 ms 784 KB Correct
55 Correct 9 ms 1008 KB Correct
56 Correct 10 ms 888 KB Correct
57 Correct 9 ms 880 KB Correct
58 Correct 9 ms 1012 KB Correct
59 Correct 10 ms 780 KB Correct
60 Correct 10 ms 772 KB Correct
61 Correct 9 ms 908 KB Correct
62 Correct 9 ms 888 KB Correct
63 Correct 9 ms 1012 KB Correct
64 Correct 9 ms 776 KB Correct
65 Correct 9 ms 888 KB Correct
66 Correct 9 ms 784 KB Correct
67 Correct 10 ms 780 KB Correct
68 Correct 9 ms 788 KB Correct
69 Correct 9 ms 784 KB Correct
70 Correct 9 ms 1012 KB Correct
71 Correct 8 ms 780 KB Correct
72 Correct 8 ms 780 KB Correct
73 Partially correct 8 ms 884 KB Wrong
74 Partially correct 10 ms 908 KB Wrong
75 Partially correct 9 ms 740 KB Wrong
76 Correct 9 ms 788 KB Correct
77 Partially correct 9 ms 780 KB Wrong
78 Partially correct 8 ms 1016 KB Wrong
79 Partially correct 8 ms 1020 KB Wrong
80 Partially correct 8 ms 788 KB Wrong
81 Partially correct 9 ms 1208 KB Wrong
82 Partially correct 8 ms 792 KB Wrong
83 Partially correct 9 ms 1004 KB Wrong
84 Partially correct 9 ms 780 KB Wrong
85 Partially correct 11 ms 1040 KB Wrong
86 Partially correct 8 ms 892 KB Wrong
87 Partially correct 9 ms 780 KB Wrong
88 Correct 9 ms 772 KB Correct
89 Partially correct 9 ms 644 KB Wrong
90 Partially correct 9 ms 784 KB Wrong
91 Partially correct 9 ms 888 KB Wrong
92 Partially correct 9 ms 772 KB Wrong
93 Partially correct 8 ms 788 KB Wrong
94 Partially correct 9 ms 780 KB Wrong
95 Partially correct 10 ms 788 KB Wrong
96 Partially correct 9 ms 792 KB Wrong
97 Partially correct 9 ms 644 KB Wrong
98 Partially correct 8 ms 792 KB Wrong
99 Partially correct 9 ms 784 KB Wrong
100 Partially correct 8 ms 784 KB Wrong
101 Partially correct 8 ms 1012 KB Wrong
102 Partially correct 9 ms 784 KB Wrong
103 Correct 9 ms 780 KB Correct
104 Partially correct 8 ms 1012 KB Wrong
105 Partially correct 8 ms 908 KB Wrong
106 Partially correct 9 ms 1008 KB Wrong
107 Partially correct 8 ms 780 KB Wrong
108 Partially correct 10 ms 784 KB Wrong
109 Partially correct 8 ms 788 KB Wrong
110 Partially correct 8 ms 784 KB Wrong
111 Partially correct 8 ms 788 KB Wrong
112 Partially correct 8 ms 792 KB Wrong
113 Partially correct 9 ms 1012 KB Wrong
114 Partially correct 9 ms 784 KB Wrong
115 Partially correct 8 ms 780 KB Wrong
116 Partially correct 9 ms 788 KB Wrong
117 Partially correct 9 ms 932 KB Wrong
118 Partially correct 8 ms 792 KB Wrong
119 Partially correct 8 ms 792 KB Wrong
120 Partially correct 9 ms 784 KB Wrong