oj.uz

답안 #234407

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
234407 2020-05-24T07:08:42 Z kartel Deda (COCI17_deda) C++14
120 / 140
 1000 ms 2332 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +300500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int tim[N], n, q, i, x, a, y, b, ans;
char c;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> q;

    for (i = 1; i <= n; i++) tim[i] = 2e9;

    while (q--)
    {
        cin >> c;
        if (c == 'M')
        {
            cin >> x >> a;
            tim[a] = x;
        }
        else
        {
            cin >> y >> b;
            ans = 0;

            for (i = b; i <= n; i++)
                if (tim[i] <= y)
                  {
                      cout << i << el;
                      break;
                  }

            if (i > n) cout << "-1" << el;
        }
    }
}

Subtask #1
120.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Execution timed out 1094 ms 1656 KB Time limit exceeded
5 Correct 208 ms 1528 KB Output is correct
6 Correct 321 ms 2124 KB Output is correct
7 Correct 500 ms 2332 KB Output is correct