제출 #349235

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
349235	2021-01-17 07:30:51	dolphingarlic	The Potion of Great Power (CEOI20_potion)	C++14	100 / 100	1827 ms	59500 KiB

potion

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9, C = 20;
int H[100000];
bool odd[100000];
vector<int> u_times[100000];
vector<vector<int>> trust[100000];
struct cmp {
    bool operator()(pair<int, int> a, pair<int, int> b) const {
        return tie(H[a.second], a.first) < tie(H[b.second], b.first);
    }
};
vector<set<pair<int, int>, cmp>> updates[100000];
void init(int N, int D, int H[]) {
    for (int i = 0; i < N; i++) {
        trust[i].push_back({});
        updates[i].push_back({});
        u_times[i].push_back(0);
        ::H[i] = H[i];
    }
}
vector<int> playback(int s, int t) {
    int ub = upper_bound(u_times[s].begin(), u_times[s].end(), t) - u_times[s].begin() - 1;
    vector<int> orig = trust[s][ub];
    set<pair<int, int>, cmp> upd = updates[s][ub];
    for (int i : orig) odd[i] ^= 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

컴파일 시 표준 에러 (stderr) 메시지

potion.cpp: In function 'std::vector<int> playback(int, int)':
potion.cpp:43:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     while (ptr1 < ret1.size() && ptr2 < ret2.size()) {
      |            ~~~~~^~~~~~~~~~~~~
potion.cpp:43:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     while (ptr1 < ret1.size() && ptr2 < ret2.size()) {
      |                                  ~~~~~^~~~~~~~~~~~~
potion.cpp:47:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     while (ptr1 < ret1.size()) mrg.push_back(ret1[ptr1++]);
      |            ~~~~~^~~~~~~~~~~~~
potion.cpp:48:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     while (ptr2 < ret2.size()) mrg.push_back(ret2[ptr2++]);
      |            ~~~~~^~~~~~~~~~~~~
potion.cpp: In function 'int question(int, int, int)':
potion.cpp:73:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for (int xptr = 0, yptr = 0; xptr != sx.size() && yptr != sy.size();) {
      |                                  ~~~~~^~~~~~~~~~~~
potion.cpp:73:60: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for (int xptr = 0, yptr = 0; xptr != sx.size() && yptr != sy.size();) {
      |                                                       ~~~~~^~~~~~~~~~~~

• Subtask 1: 0 / 0
• Subtask 2: 17 / 17
• Subtask 3: 14 / 14
• Subtask 4: 18 / 18
• Subtask 5: 21 / 21
• Subtask 6: 30 / 30