| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1281272 | tunademayo | Advertisement 2 (JOI23_ho_t2) | C++20 | 49 ms | 6888 KiB |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const bool Multitest = 0;
const int N = 2e5 + 10;
struct Data
{
int a, b;
}; Data a[N];
int n;
namespace sub1
{
bool check()
{
for(int i = 1 ; i < n ; i++)
{
if(a[i].b != a[i + 1].b) return 0;
}
return 1;
}
set<int> s;
void solve()
{
for(int i = 1 ; i <= n ; i++)
{
s.insert(a[i].a);
}
cout << s.size();
}
}
void work()
{
cin >> n;
for(int i = 1 ; i <= n ; i++) cin >> a[i].a >> a[i].b;
if(sub1::check())
{
sub1::solve();
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int q = 1;
if(fopen("task.inp", "r"))
{
freopen("task.inp", "r", stdin);
freopen("task.out", "w", stdout);
}
if(Multitest) cin >> q;
while(q--) work();
}
Compilation message (stderr)
| # | 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... | ||||
