Submission #38454401


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int q;
set<long long> s;

int main() {
	scanf("%d", &q);
	for (int tt = 0; tt <= q; tt++) {
		int tmp = 1;
		if (tt != 0)
			scanf("%d", &tmp);
		long long ta, tb;
		scanf("%lld%lld", &ta, &tb);
		if (tmp == 1) {
			s.insert(ta - tb);
			s.insert(ta + tb);
		} else {
			long long ans = LLONG_MAX;
			auto it = s.lower_bound(ta);
			if (it != s.begin())
				ans = min(ans, ta - *prev(it));
			if (it != s.end())
				if (*it <= tb)
					ans = 0;
				else 
					ans = min(ans, *it - tb);
			printf("%lld\n", ans);
		}
	}
}

Submission Info

Submission Time
Task B - Abs Abs Function
User nhho
Language C++ (GCC 9.2.1)
Score 500
Code Size 601 Byte
Status AC
Exec Time 216 ms
Memory 20672 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:24:7: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wdangling-else]
   24 |    if (it != s.end())
      |       ^
./Main.cpp:9:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    9 |  scanf("%d", &q);
      |  ~~~~~^~~~~~~~~~
./Main.cpp:13:9: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   13 |    scanf("%d", &tmp);
      |    ~~~~~^~~~~~~~~~~~
./Main.cpp:15:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   15 |   scanf("%lld%lld", &ta, &tb);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 34
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_rand1_01.txt, 01_rand1_02.txt, 01_rand1_03.txt, 01_rand1_04.txt, 01_rand1_05.txt, 01_rand1_06.txt, 01_rand1_07.txt, 01_rand1_08.txt, 01_rand1_09.txt, 01_rand1_10.txt, 01_rand1_11.txt, 01_rand1_12.txt, 01_rand1_13.txt, 01_rand1_14.txt, 02_rand2_01.txt, 02_rand2_02.txt, 02_rand2_03.txt, 02_rand2_04.txt, 02_rand2_05.txt, 02_rand2_06.txt, 02_rand2_07.txt, 02_rand2_08.txt, 02_rand2_09.txt, 02_rand2_10.txt, 02_rand2_11.txt, 02_rand2_12.txt, 02_rand2_13.txt, 02_rand2_14.txt, 02_rand2_15.txt, 03_test_01.txt, 03_test_02.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 14 ms 3660 KiB
00_sample_02.txt AC 2 ms 3696 KiB
00_sample_03.txt AC 2 ms 3612 KiB
01_rand1_01.txt AC 164 ms 12936 KiB
01_rand1_02.txt AC 177 ms 13176 KiB
01_rand1_03.txt AC 170 ms 12956 KiB
01_rand1_04.txt AC 168 ms 13072 KiB
01_rand1_05.txt AC 165 ms 12988 KiB
01_rand1_06.txt AC 166 ms 12988 KiB
01_rand1_07.txt AC 166 ms 12992 KiB
01_rand1_08.txt AC 170 ms 12984 KiB
01_rand1_09.txt AC 171 ms 13076 KiB
01_rand1_10.txt AC 165 ms 13080 KiB
01_rand1_11.txt AC 180 ms 13072 KiB
01_rand1_12.txt AC 174 ms 13112 KiB
01_rand1_13.txt AC 171 ms 12956 KiB
01_rand1_14.txt AC 178 ms 13036 KiB
02_rand2_01.txt AC 132 ms 13016 KiB
02_rand2_02.txt AC 134 ms 13080 KiB
02_rand2_03.txt AC 133 ms 13012 KiB
02_rand2_04.txt AC 124 ms 13056 KiB
02_rand2_05.txt AC 127 ms 13056 KiB
02_rand2_06.txt AC 128 ms 13132 KiB
02_rand2_07.txt AC 157 ms 13168 KiB
02_rand2_08.txt AC 168 ms 12996 KiB
02_rand2_09.txt AC 157 ms 12984 KiB
02_rand2_10.txt AC 141 ms 20492 KiB
02_rand2_11.txt AC 138 ms 20452 KiB
02_rand2_12.txt AC 145 ms 20672 KiB
02_rand2_13.txt AC 216 ms 20572 KiB
02_rand2_14.txt AC 206 ms 20436 KiB
02_rand2_15.txt AC 212 ms 20572 KiB
03_test_01.txt AC 3 ms 3572 KiB
03_test_02.txt AC 173 ms 12948 KiB