oj.uz

답안 #1078939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078939 2024-08-28T08:24:35 Z vahagng Infinite Race (EGOI24_infiniterace2) C++17
100 / 100
 62 ms 11092 KB 
//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;

// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}

#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'

const ll inf = 1e18, mod = 1e9+7, mod1 = 998244353;

void SetIO(string str = "") {
    if (str != "") {
        freopen((str + ".in").c_str(), "r", stdin);
        freopen((str + ".out").c_str(), "w", stdout);
    } else {
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    }
}
 
void FastIO() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

ll mult(ll a, ll b){
    return (a*b)%mod;
}

ll add(ll a, ll b){
    return (a + b)%mod;
}

ll sub(ll a, ll b){
    return (a - b + mod)%mod;
}

/*
4 2 4
2 3
0 2
0 3
0 6
0 7
*/

// expected output
/*
2
3
1
*/

ll power(ll a, ll b){
    ll res = 1;
    while(b--){
        res *= a;
    }
    return res;
}

/*
5
1 2
3 1
2 1
4 2
5 1
*/

const int N = 3e5 + 10, M = N;

ll n, q;

void solve(int tc){
    cin >> n >> q;
    set<ll>st;
    ll ans = 0;
    while(q--){
        int a;
        cin >> a;
        if(a < 0){
            if(st.find(-a) != st.end()){
                st.erase(-a);
            }
        }else{
            if(st.find(a) != st.end()){
                ans++;
                st.clear();
                st.insert(a);
            }else{
                st.insert(a);
            }
        }
    }
    cout << ans << endl;
}

void precalc(){
}

int main() {
    // SetIO("");
    FastIO();
    int test_case = 1;
    // cin >> test_case;
    precalc();
    int cnt = 1;
    while (test_case--){
      solve(cnt++);
    }
    return 0;
}

Compilation message

Main.cpp: In function 'void SetIO(std::string)':
Main.cpp:47:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |         freopen((str + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen((str + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 11 ms 824 KB Output is correct
5 Correct 11 ms 860 KB Output is correct
6 Correct 11 ms 856 KB Output is correct
7 Correct 11 ms 856 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 10 ms 852 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 9 ms 860 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 11 ms 948 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 10 ms 856 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 13 ms 824 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct

Subtask #2
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 12 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 62 ms 11092 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 12 ms 676 KB Output is correct
8 Correct 13 ms 604 KB Output is correct
9 Correct 14 ms 824 KB Output is correct
10 Correct 16 ms 860 KB Output is correct
11 Correct 21 ms 1116 KB Output is correct
12 Correct 24 ms 1324 KB Output is correct
13 Correct 28 ms 1612 KB Output is correct
14 Correct 32 ms 1748 KB Output is correct
15 Correct 41 ms 1620 KB Output is correct
16 Correct 34 ms 1780 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 17 ms 1628 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 15 ms 1596 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 352 KB Output is correct
11 Correct 0 ms 356 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 1 ms 452 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 352 KB Output is correct
19 Correct 0 ms 352 KB Output is correct
20 Correct 0 ms 352 KB Output is correct
21 Correct 0 ms 352 KB Output is correct
22 Correct 1 ms 608 KB Output is correct
23 Correct 0 ms 352 KB Output is correct
24 Correct 0 ms 352 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 11 ms 824 KB Output is correct
5 Correct 11 ms 860 KB Output is correct
6 Correct 11 ms 856 KB Output is correct
7 Correct 11 ms 856 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 10 ms 852 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 9 ms 860 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 11 ms 948 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 10 ms 856 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 13 ms 824 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 12 ms 604 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 62 ms 11092 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 12 ms 676 KB Output is correct
28 Correct 13 ms 604 KB Output is correct
29 Correct 14 ms 824 KB Output is correct
30 Correct 16 ms 860 KB Output is correct
31 Correct 21 ms 1116 KB Output is correct
32 Correct 24 ms 1324 KB Output is correct
33 Correct 28 ms 1612 KB Output is correct
34 Correct 32 ms 1748 KB Output is correct
35 Correct 41 ms 1620 KB Output is correct
36 Correct 34 ms 1780 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 17 ms 1628 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 15 ms 1596 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 352 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 352 KB Output is correct
52 Correct 1 ms 352 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 352 KB Output is correct
55 Correct 0 ms 356 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 0 ms 360 KB Output is correct
58 Correct 0 ms 352 KB Output is correct
59 Correct 1 ms 452 KB Output is correct
60 Correct 0 ms 352 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 352 KB Output is correct
63 Correct 0 ms 352 KB Output is correct
64 Correct 0 ms 352 KB Output is correct
65 Correct 0 ms 352 KB Output is correct
66 Correct 1 ms 608 KB Output is correct
67 Correct 0 ms 352 KB Output is correct
68 Correct 0 ms 352 KB Output is correct
69 Correct 1 ms 352 KB Output is correct
70 Correct 0 ms 352 KB Output is correct
71 Correct 0 ms 352 KB Output is correct
72 Correct 11 ms 832 KB Output is correct
73 Correct 12 ms 864 KB Output is correct
74 Correct 11 ms 860 KB Output is correct
75 Correct 10 ms 860 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 10 ms 824 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 13 ms 860 KB Output is correct
81 Correct 1 ms 604 KB Output is correct
82 Correct 12 ms 952 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 12 ms 856 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 10 ms 604 KB Output is correct
87 Correct 0 ms 348 KB Output is correct
88 Correct 61 ms 10836 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 12 ms 604 KB Output is correct
91 Correct 12 ms 820 KB Output is correct
92 Correct 13 ms 604 KB Output is correct
93 Correct 27 ms 1116 KB Output is correct
94 Correct 20 ms 1112 KB Output is correct
95 Correct 24 ms 1372 KB Output is correct
96 Correct 29 ms 1360 KB Output is correct
97 Correct 32 ms 1624 KB Output is correct
98 Correct 33 ms 1884 KB Output is correct
99 Correct 31 ms 1628 KB Output is correct
100 Correct 0 ms 344 KB Output is correct
101 Correct 1 ms 604 KB Output is correct
102 Correct 16 ms 1628 KB Output is correct
103 Correct 0 ms 348 KB Output is correct
104 Correct 15 ms 1592 KB Output is correct
105 Correct 0 ms 348 KB Output is correct
106 Correct 0 ms 348 KB Output is correct
107 Correct 0 ms 348 KB Output is correct
108 Correct 0 ms 604 KB Output is correct
109 Correct 0 ms 348 KB Output is correct
110 Correct 0 ms 348 KB Output is correct
111 Correct 0 ms 348 KB Output is correct
112 Correct 44 ms 3500 KB Output is correct
113 Correct 52 ms 2652 KB Output is correct
114 Correct 50 ms 6484 KB Output is correct
115 Correct 32 ms 2392 KB Output is correct
116 Correct 15 ms 1628 KB Output is correct
117 Correct 0 ms 348 KB Output is correct
118 Correct 11 ms 724 KB Output is correct
119 Correct 12 ms 824 KB Output is correct
120 Correct 13 ms 860 KB Output is correct
121 Correct 16 ms 1080 KB Output is correct
122 Correct 19 ms 1116 KB Output is correct
123 Correct 25 ms 1220 KB Output is correct
124 Correct 25 ms 1628 KB Output is correct
125 Correct 27 ms 1884 KB Output is correct
126 Correct 34 ms 1872 KB Output is correct
127 Correct 28 ms 1884 KB Output is correct
128 Correct 17 ms 1624 KB Output is correct
129 Correct 13 ms 1884 KB Output is correct
130 Correct 0 ms 348 KB Output is correct
131 Correct 0 ms 348 KB Output is correct
132 Correct 0 ms 348 KB Output is correct
133 Correct 0 ms 348 KB Output is correct
134 Correct 0 ms 348 KB Output is correct