oj.uz

답안 #150594

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
150594 2019-09-01T08:41:43 Z Greedy left the chat.(#3618, miguel, claudy, MvC) 포도주 시음 (FXCUP4_wine) C++17
4 / 100
 10 ms 1024 KB 
/*
░░░░░░░░░░░░░░░░▄▄█▀▀██▄▄░░░░░░░
░░░░░░░░░░░░░▄█▀▀░░░░░░░▀█░░░░░░
░░░░░░░░░░░▄▀░░░░░░░░░░░░░█░░░░░
░░░░░░░░░▄█░░░░░░░░░░░░░░░█░░░░░
░░░░░░░██▀░░░░░░░▄▄▄░░▄░█▄█▄░░░░
░░░░░▄▀░░░░░░░░░░████░█▄██░▀▄░░░
░░░░█▀░░░░░░░░▄▄██▀░░█████░██░░░
░░░█▀░░░░░░░░░▀█░▀█▀█▀▀▄██▄█▀░░░
░░░██░░░░░░░░░░█░░█░█░░▀▀▄█▀░░░░
░░░░█░░░░░█░░░▀█░░░░▄░░░░░▄█░░░░
░░░░▀█░░░░███▄░█░░░░░░▄▄▄▄█▀█▄░░
░░░░░▀██░░█▄▀▀██░░░░░░░░▄▄█░░▀▄░
░░░░░░▀▀█▄░▀▄▄░▄░░░░░░░███▀░░▄██
░░░░░░░░░▀▀▀███▀█▄░░░░░█▀░▀░░░▀█
░░░░░░░░░░░░▄▀░░░▀█▄░░░░░▄▄░░▄█▀
░░░▄▄▄▀▀▀▀▀█▀░░░░░█▄▀▄▄▄▄▄▄█▀▀░░
░▄█░░░▄██▀░░░░░░░░░█▄░░░░░░░░░░░
█▀▀░▄█░░░░░░░░░░░░░░▀▀█▄░░░░░░░░
█░░░█░░░░░░░░░░░░░░░░░░█▄░░░░░░░
*/
#include<bits/stdc++.h>
#include<bartender.h>
using namespace std;
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define x first
#define y second
#define pi pair <int, int>
#define vi vector <int>
#define L nod<<1
#define R ((nod<<1)|1)
#define mp make_pair
const ll mod = 1000000007;
const ll nmax=1000003;

vi BlendWines(int k, vi r){
    int n=r.size();
    vi v;
    for(int i: r) v.pb(max(1, i-(n-k)));
    return v;
}



/*int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
}*/

/*
░░░░░░░░░░░░░░░░▄▄█▀▀██▄▄░░░░░░░
░░░░░░░░░░░░░▄█▀▀░░░░░░░▀█░░░░░░
░░░░░░░░░░░▄▀░░░░░░░░░░░░░█░░░░░
░░░░░░░░░▄█░░░░░░░░░░░░░░░█░░░░░
░░░░░░░██▀░░░░░░░▄▄▄░░▄░█▄█▄░░░░
░░░░░▄▀░░░░░░░░░░████░█▄██░▀▄░░░
░░░░█▀░░░░░░░░▄▄██▀░░█████░██░░░
░░░█▀░░░░░░░░░▀█░▀█▀█▀▀▄██▄█▀░░░
░░░██░░░░░░░░░░█░░█░█░░▀▀▄█▀░░░░
░░░░█░░░░░█░░░▀█░░░░▄░░░░░▄█░░░░
░░░░▀█░░░░███▄░█░░░░░░▄▄▄▄█▀█▄░░
░░░░░▀██░░█▄▀▀██░░░░░░░░▄▄█░░▀▄░
░░░░░░▀▀█▄░▀▄▄░▄░░░░░░░███▀░░▄██
░░░░░░░░░▀▀▀███▀█▄░░░░░█▀░▀░░░▀█
░░░░░░░░░░░░▄▀░░░▀█▄░░░░░▄▄░░▄█▀
░░░▄▄▄▀▀▀▀▀█▀░░░░░█▄▀▄▄▄▄▄▄█▀▀░░
░▄█░░░▄██▀░░░░░░░░░█▄░░░░░░░░░░░
█▀▀░▄█░░░░░░░░░░░░░░▀▀█▄░░░░░░░░
█░░░█░░░░░░░░░░░░░░░░░░█▄░░░░░░░*/
#include<bits/stdc++.h>
#include<taster.h>
using namespace std;
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define x first
#define y second
#define pi pair <int, int>
#define vi vector <int>
#define mp make_pair
const ll mod = 1000000007;
const ll nmax=100010;

vi SortWines(int k, vi a){
    int n=a.size();
    vi ans, p;
    for(int i: a) ans.pb(i);
    for(int i=0; i<n; i++) if(ans[i]==1) p.pb(i);
    for(int i=0; i<p.size(); i++){
        for(int j=i+1; j<p.size(); j++){
            int x=Compare(p[i], p[j]);
            if(x==-1) ans[p[i]]++;
            else ans[p[j]]++;
        }
    }
    for(int i: p) ans[i]-=(n-k);
    for(int i=1; i<=n; i++) ans[i-1]+=(n-k);
    return ans;
}


/*int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    cin>>n>>k;
    while(n--) cout<<rng()%k<<endl;
}*/

Compilation message

taster.cpp: In function 'std::vector<int> SortWines(int, std::vector<int>)':
taster.cpp:40:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<p.size(); i++){
                  ~^~~~~~~~~
taster.cpp:41:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=i+1; j<p.size(); j++){
                        ~^~~~~~~~~

Subtask #1
4.0 / 100.0

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