제출 #1067515

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1067515		YENGOYAN	Infinite Race (EGOI24_infiniterace2)	C++17	0 / 100	57 ms	11872 KiB

Main

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define PUT(a, b) freopen(a, "r", stdin); freopen(b, "w", stdout);
#define all(a) a.begin(), a.end()
#define answerNO {cout << "NO" << endl; return;}
#define answerYES {cout << "YES" << endl; return;}
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
template<class T> T setmax(T& a, T b) { if (a < b) return a = b; return a; }
template<class T> T setmin(T& a, T b) { if (a < b) return a; return a = b; }
//using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
ll mod = 1e9 + 7;


void solve() {
    int n, q; cin >> n >> q;
    map<int, int> mp;
    vector<int> lst(n, -1);
    int mx = 0;
    while (q--)
    {
        int c; cin >> c;
        int aC = abs(c);
        mp[aC] += c / aC;
        if (lst[aC] == 1 && c > 0) mx = max(mx, 1);
        if (c > 0) lst[aC] = 1;
        else lst[aC] = 0;
        mx = max(mx, mp[aC] - 1);
    }
    cout << mx << endl;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL), cout.tie(NULL);
    //PUT("traffic.in", "traffic.out");
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}

• Subtask 1: 0 / 29
• Subtask 2: 0 / 34
• Subtask 3: 0 / 22
• Subtask 4: 0 / 15