| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1188152 | yhx3 | Advertisement 2 (JOI23_ho_t2) | C++20 | 0 ms | 524 KiB |
#include <iostream>
#include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
#define ll long long
bool comp(const pair<ll,ll> &a,pair<ll,ll> &vl)
{
return a.second > vl.first;
}
bool scomp(const pair<ll,ll> &a,pair<ll,ll> &vl)
{
return a.first >= vl.first;
}
void solve() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
int u,v;
cin >> u >> v;
}
cout << n << endl;
}
int main() {
ios_base::sync_with_stdio(false);
int t = 1;
// cin>>t;
while(t--) {
solve();
}
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
