oj.uz

답안 #1053858

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053858 2024-08-11T18:50:47 Z mindiyak Infinite Race (EGOI24_infiniterace2) C++14
100 / 100
 13 ms 2648 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int M = 1e9+7;
void init(string name)
{
    freopen((name + ".in").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
}

void solve()
{
    int n;cin >> n;
    vi arr(n,-1);

    int m;cin >> m;
    int ans = 0;
    FOR(i,0,m){
        int a;cin>>a;
        if(a>0){
            if(arr[a] != ans){
                arr[a] = ans;
            }else{
                ans++;
                arr[a] = ans;
            }
        }
        else{
            a *= -1;
            arr[a] = -1;
        }
    }

    cout << ans << endl;
}   


int main()
{
    fastIO();
    // init("test");
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}

Compilation message

Main.cpp: In function 'void init(std::string)':
Main.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen((name + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen((name + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
29.0 / 29.0

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

Subtask #2
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 5 ms 456 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 1256 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 6 ms 604 KB Output is correct
9 Correct 6 ms 600 KB Output is correct
10 Correct 7 ms 860 KB Output is correct
11 Correct 7 ms 984 KB Output is correct
12 Correct 8 ms 1112 KB Output is correct
13 Correct 9 ms 1628 KB Output is correct
14 Correct 10 ms 2396 KB Output is correct
15 Correct 11 ms 2416 KB Output is correct
16 Correct 10 ms 2396 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 10 ms 2140 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 11 ms 2396 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 1116 KB Output is correct
24 Correct 0 ms 344 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 456 KB Output is correct
5 Correct 7 ms 456 KB Output is correct
6 Correct 7 ms 460 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 8 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 8 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 5 ms 452 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 5 ms 456 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 8 ms 1256 KB Output is correct
26 Correct 0 ms 1116 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 6 ms 604 KB Output is correct
29 Correct 6 ms 600 KB Output is correct
30 Correct 7 ms 860 KB Output is correct
31 Correct 7 ms 984 KB Output is correct
32 Correct 8 ms 1112 KB Output is correct
33 Correct 9 ms 1628 KB Output is correct
34 Correct 10 ms 2396 KB Output is correct
35 Correct 11 ms 2416 KB Output is correct
36 Correct 10 ms 2396 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 10 ms 2140 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 11 ms 2396 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 1116 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 348 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 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 7 ms 860 KB Output is correct
73 Correct 7 ms 804 KB Output is correct
74 Correct 7 ms 860 KB Output is correct
75 Correct 7 ms 860 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 6 ms 600 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 6 ms 860 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 7 ms 800 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 7 ms 892 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 5 ms 604 KB Output is correct
87 Correct 0 ms 348 KB Output is correct
88 Correct 9 ms 2396 KB Output is correct
89 Correct 0 ms 1116 KB Output is correct
90 Correct 6 ms 604 KB Output is correct
91 Correct 6 ms 564 KB Output is correct
92 Correct 6 ms 604 KB Output is correct
93 Correct 7 ms 860 KB Output is correct
94 Correct 7 ms 1056 KB Output is correct
95 Correct 8 ms 1240 KB Output is correct
96 Correct 9 ms 1628 KB Output is correct
97 Correct 10 ms 2524 KB Output is correct
98 Correct 11 ms 2396 KB Output is correct
99 Correct 10 ms 2400 KB Output is correct
100 Correct 0 ms 456 KB Output is correct
101 Correct 0 ms 348 KB Output is correct
102 Correct 10 ms 2140 KB Output is correct
103 Correct 0 ms 348 KB Output is correct
104 Correct 11 ms 2396 KB Output is correct
105 Correct 1 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 348 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 452 KB Output is correct
112 Correct 11 ms 2396 KB Output is correct
113 Correct 10 ms 1628 KB Output is correct
114 Correct 10 ms 2336 KB Output is correct
115 Correct 10 ms 1628 KB Output is correct
116 Correct 10 ms 2388 KB Output is correct
117 Correct 1 ms 1116 KB Output is correct
118 Correct 8 ms 932 KB Output is correct
119 Correct 7 ms 904 KB Output is correct
120 Correct 7 ms 820 KB Output is correct
121 Correct 8 ms 1076 KB Output is correct
122 Correct 9 ms 1072 KB Output is correct
123 Correct 9 ms 1308 KB Output is correct
124 Correct 10 ms 1640 KB Output is correct
125 Correct 12 ms 2648 KB Output is correct
126 Correct 11 ms 2396 KB Output is correct
127 Correct 13 ms 2320 KB Output is correct
128 Correct 11 ms 2392 KB Output is correct
129 Correct 11 ms 2640 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 1116 KB Output is correct
134 Correct 0 ms 348 KB Output is correct