Submission #5573521

Source Code Expand

#include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;

int main()
{
	LL N;
	in >> N;
	std::vector<LL>A(N), B(N);
	rep(i, N) in >> A[i] >> B[i];

	std::set<std::pair<LL, LL>>coins;
	rep(i, N) coins.insert(std::make_pair(std::min(A[i], B[i]), std::max(A[i], B[i])));
	out << coins.size() << std::endl;
}

Submission Info

Submission Time
Task F - 種類数 α
User Bwambocos
Language C++14 (GCC 5.4.1)
Score 300
Code Size 395 Byte
Status AC
Exec Time 230 ms
Memory 15872 KiB

Judge Result

Set Name sample all
Score / Max Score 0 / 0 300 / 300
Status
AC × 1
AC × 9
Set Name Test Cases
sample sample-01.txt
all sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, sample-01.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 256 KiB
01-02.txt AC 1 ms 256 KiB
01-03.txt AC 9 ms 384 KiB
01-04.txt AC 9 ms 384 KiB
01-05.txt AC 230 ms 15872 KiB
01-06.txt AC 229 ms 15872 KiB
01-07.txt AC 180 ms 3840 KiB
sample-01.txt AC 1 ms 256 KiB