oj.uz

Submission #893654

# Submission time Handle Problem Language Result Execution time Memory
893654 2023-12-27T08:45:59 Z vjudge1 Segments (IZhO18_segments) C++17
7 / 100
 5000 ms 10064 KB 
// 以上帝的名义
// 候选硕士
#include <bits/stdc++.h>

#ifdef local
#include "algo/debug.h"
#else
#define dbg(x...) 0
#endif

using namespace std ;
using ll = long long ;
using ld = long double ;

int32_t main() {
    int n, t ;
    scanf("%d%d", &n, &t) ;
    int last = 0 ;
    map<pair<int,int>,int> cnt ;
    map<int,pair<int,int>> ind ;
    int idx = 0 ;
    for (int i = 0 ; i < n ; i++ ){
        int type ; scanf("%d", &type) ;
        if (type == 1) {
            int a, b ; scanf("%d%d", &a, &b) ;
            int l = (a ^ (last * t)) ;
            int r = (b ^ (last * t)) ;
            if (l > r) swap(l, r) ;
            cnt[{l,r}]++ ; idx++ ;
            ind[idx] = {l, r} ;
//            dbg(type, l, r) ;
        } else if (type == 2) {
            int j ; cin >> j ;
            auto c = ind[j] ;
            cnt[c]-- ;
            if (cnt[c] == 0) cnt.erase(c) ;
        } else {
            int a, b, k ;scanf("%d%d%d", &a, &b, &k) ;
            int l = (a ^ (t * last)) ;
            int r = (b ^ (t * last)) ;
            if (l > r) swap(l, r) ;
            int ans = 0 ;
            for (auto [c, p] : cnt) {
                auto [L, R] = c ;
                L = max(L, l) , R = min(R , r) ;
                if (R - L + 1 >= k) {
                    ans++ ;
                }
            }
//            dbg(type, l, r) ;
            printf("%d\n", ans) ;
            last = ans ;
        }
    }
    return 0 ;
}

// 希望白银

Compilation message

segments.cpp: In function 'int32_t main()':
segments.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     scanf("%d%d", &n, &t) ;
      |     ~~~~~^~~~~~~~~~~~~~~~
segments.cpp:23:25: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         int type ; scanf("%d", &type) ;
      |                    ~~~~~^~~~~~~~~~~~~
segments.cpp:25:29: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |             int a, b ; scanf("%d%d", &a, &b) ;
      |                        ~~~~~^~~~~~~~~~~~~~~~
segments.cpp:38:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |             int a, b, k ;scanf("%d%d%d", &a, &b, &k) ;
      |                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 544 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 42 ms 860 KB Output is correct
6 Correct 52 ms 860 KB Output is correct
7 Correct 10 ms 604 KB Output is correct
8 Correct 25 ms 800 KB Output is correct
9 Correct 25 ms 784 KB Output is correct
10 Correct 13 ms 860 KB Output is correct
11 Correct 47 ms 752 KB Output is correct
12 Correct 51 ms 604 KB Output is correct
13 Correct 15 ms 996 KB Output is correct
14 Correct 20 ms 604 KB Output is correct
15 Correct 3 ms 456 KB Output is correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 14 ms 644 KB Output is correct
18 Correct 19 ms 860 KB Output is correct
19 Correct 14 ms 604 KB Output is correct
20 Correct 16 ms 684 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5072 ms 6956 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 2532 KB Output is correct
2 Correct 96 ms 2560 KB Output is correct
3 Correct 162 ms 2772 KB Output is correct
4 Correct 78 ms 2776 KB Output is correct
5 Execution timed out 5058 ms 9396 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 2536 KB Output is correct
2 Correct 76 ms 2520 KB Output is correct
3 Correct 74 ms 2360 KB Output is correct
4 Correct 85 ms 2480 KB Output is correct
5 Execution timed out 5012 ms 10064 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 544 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 42 ms 860 KB Output is correct
6 Correct 52 ms 860 KB Output is correct
7 Correct 10 ms 604 KB Output is correct
8 Correct 25 ms 800 KB Output is correct
9 Correct 25 ms 784 KB Output is correct
10 Correct 13 ms 860 KB Output is correct
11 Correct 47 ms 752 KB Output is correct
12 Correct 51 ms 604 KB Output is correct
13 Correct 15 ms 996 KB Output is correct
14 Correct 20 ms 604 KB Output is correct
15 Correct 3 ms 456 KB Output is correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 14 ms 644 KB Output is correct
18 Correct 19 ms 860 KB Output is correct
19 Correct 14 ms 604 KB Output is correct
20 Correct 16 ms 684 KB Output is correct
21 Execution timed out 5072 ms 6956 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 544 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 42 ms 860 KB Output is correct
6 Correct 52 ms 860 KB Output is correct
7 Correct 10 ms 604 KB Output is correct
8 Correct 25 ms 800 KB Output is correct
9 Correct 25 ms 784 KB Output is correct
10 Correct 13 ms 860 KB Output is correct
11 Correct 47 ms 752 KB Output is correct
12 Correct 51 ms 604 KB Output is correct
13 Correct 15 ms 996 KB Output is correct
14 Correct 20 ms 604 KB Output is correct
15 Correct 3 ms 456 KB Output is correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 14 ms 644 KB Output is correct
18 Correct 19 ms 860 KB Output is correct
19 Correct 14 ms 604 KB Output is correct
20 Correct 16 ms 684 KB Output is correct
21 Execution timed out 5072 ms 6956 KB Time limit exceeded
22 Halted 0 ms 0 KB -