oj.uz

Submission #944398

# Submission time Handle Problem Language Result Execution time Memory
944398 2024-03-12T16:51:30 Z dilanyan Segments (IZhO18_segments) C++17
0 / 100
 3510 ms 4316 KB 
//-------------dilanyan------------\\ 
 
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
 
//------------------KarginDefines--------------------\\ 
 
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set
#define Kargin ios_base::sync_with_stdio(false);cin.tie(NULL);
#define Usaco freopen(".in", "r", stdin); freopen(".out", "w", stdout);
 
 
//-------------------KarginConstants------------------\\ 
 
const ll mod = 1000000007;
const ll inf = 2e9;
 
//-------------------KarginCode------------------------\\ 
 
const int N = 200005;

void KarginSolve() {
    int n, t;
    cin >> n >> t;
    vector<pair<int, int>> v;
    while (n--) {
        int tp; cin >> tp;
        if (tp == 3) break;
        int a, b;
        cin >> a >> b;
        if (a > b) swap(a, b);
        v.pb({ a,b });
    }
    int a, b, k;
    cin >> a >> b >> k;
    if (a > b) swap(a, b);
    int lastans = 0;
    for (auto it : v) {
        if (min(it.second, b) - max(it.first, a) + 1 >= k) lastans++;
    }
    cout << lastans << '\n';
    while (n--) {
        int tp, a, b, k;
        cin >> t >> a >> b >> k;
        a ^= (tp * lastans), b ^= (tp * lastans);
        if (a > b) swap(a, b);
        int ans = 0;
        for (auto it : v) {
            if (min(it.second, b) - max(it.first, a) + 1 >= k) ans++;
        }
        lastans = ans;
        cout << lastans << '\n';
    }
}
 
int main() {
    //Usaco
    Kargin;
    int test = 1;
    //cin >> test;
    while (test--) {
        KarginSolve();
    }
    return 0;
}

Compilation message

segments.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //-------------dilanyan------------\\
      | ^
segments.cpp:8:1: warning: multi-line comment [-Wcomment]
    8 | //------------------KarginDefines--------------------\\
      | ^
segments.cpp:22:1: warning: multi-line comment [-Wcomment]
   22 | //-------------------KarginConstants------------------\\
      | ^
segments.cpp:27:1: warning: multi-line comment [-Wcomment]
   27 | //-------------------KarginCode------------------------\\
      | ^
segments.cpp: In function 'void KarginSolve()':
segments.cpp:54:18: warning: 'tp' may be used uninitialized in this function [-Wmaybe-uninitialized]
   54 |         a ^= (tp * lastans), b ^= (tp * lastans);
      |              ~~~~^~~~~~~~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3457 ms 1392 KB Output is correct
2 Correct 3510 ms 3924 KB Output is correct
3 Correct 3492 ms 3948 KB Output is correct
4 Correct 3509 ms 4316 KB Output is correct
5 Correct 747 ms 3632 KB Output is correct
6 Correct 399 ms 3532 KB Output is correct
7 Incorrect 3418 ms 3836 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 548 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -