oj.uz

Submission #925249

# Submission time Handle Problem Language Result Execution time Memory
925249 2024-02-11T08:08:57 Z Akshat369 Advertisement 2 (JOI23_ho_t2) C++17
10 / 100
 360 ms 38544 KB 
#include <bits/stdc++.h>

using namespace std;
#define int long long
#define INF (int)1e18
#define endl '\n'
const int mod = 1000 * 1000 * 1000 + 7;
const int N = 100005;
#define f first
#define s second
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define rrep(i, a, b) for(int i = (a); i > (b); i--)
#define vi vector<int>
#define pii pair<int, int>

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() {
    int n; cin>>n;
    vi x(n) , e(n);
    set<int> st;
    for (int i = 0; i < n; ++i) {
        cin >> x[i] >> e[i];
        st.insert(x[i]);
    }
    cout<<st.size()<<endl;
    
  
}

int32_t main() {
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
  //  cin >> t;
    for (int i = 1; i <= t; i++) {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 59 ms 10092 KB Output is correct
3 Correct 62 ms 10324 KB Output is correct
4 Correct 107 ms 16864 KB Output is correct
5 Correct 51 ms 11824 KB Output is correct
6 Correct 360 ms 38544 KB Output is correct
7 Correct 219 ms 28076 KB Output is correct
8 Correct 119 ms 18100 KB Output is correct
9 Correct 81 ms 17992 KB Output is correct

Subtask #2
0 / 23.0

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

Subtask #3
0 / 36.0

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

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 59 ms 10092 KB Output is correct
3 Correct 62 ms 10324 KB Output is correct
4 Correct 107 ms 16864 KB Output is correct
5 Correct 51 ms 11824 KB Output is correct
6 Correct 360 ms 38544 KB Output is correct
7 Correct 219 ms 28076 KB Output is correct
8 Correct 119 ms 18100 KB Output is correct
9 Correct 81 ms 17992 KB Output is correct
10 Incorrect 1 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -