QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#589191 | #9294. Integer Perimeter | shift | AC ✓ | 0ms | 3720kb | C++20 | 4.8kb | 2024-09-25 16:37:08 | 2024-09-25 16:37:09 |
Judging History
answer
// #pragma once
// C
#include <cassert>
#include <cctype>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <csetjmp>
#include <cstdarg>
#include <cstddef>
#include <cstdlib>
#include <cstdint>
// C++
#include <bitset>
#include <complex>
#include <algorithm>
#include <bitset>
#include <functional>
#include <iterator>
#include <limits>
#include <memory>
#include <new>
#include <numeric>
#include <typeinfo>
#include <utility>
#include <array>
#include <atomic>
#include <initializer_list>
#include <ratio>
#include <scoped_allocator>
#include <tuple>
#include <typeindex>
#include <type_traits>
#if _HAS_CXX17
#include <any>
// #include <execution>
#include <optional>
#include <variant>
#include <string_view>
#endif
#if _HAS_CXX20
#include <bit>
#include <compare>
#include <concepts>
#include <numbers>
#include <ranges>
#include <span>
#include <source_location>
#include <version>
#endif
#if _HAS_CXX23
#include <expected>
#include <stdatomic.h>
#if __cpp_impl_coroutine
#include <coroutine>
#endif
#endif
// C
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
// #include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cuchar>
// C++
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <codecvt>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <shared_mutex>
#if _HAS_CXX17
#include <any>
#include <charconv>
// #include <execution>
#include <filesystem>
#include <optional>
#include <memory_resource>
#include <variant>
#endif
#if _HAS_CXX20
#include <barrier>
#include <bit>
#include <compare>
#include <concepts>
#include <format>
#include <latch>
#include <numbers>
#include <ranges>
#include <span>
#include <stop_token>
#include <semaphore>
#include <source_location>
#include <syncstream>
#include <version>
#endif
#if _HAS_CXX23
#include <expected>
#include <spanstream>
#if __has_include(<stacktrace>)
#include <stacktrace>
#endif
#include <stdatomic.h>
#include <stdfloat>
#endif
using i64 = long long;
// https://github.com/Heltion/debug.h/blob/main/debug.h
template <class T, size_t size = std::tuple_size<T>::value> std::string to_debug(T, std::string s = "") requires(not std::ranges::range<T>);
std::string to_debug(auto x) requires requires(std::ostream& os) { os << x; } { return static_cast<std::ostringstream>(std::ostringstream() << x).str(); }
std::string to_debug(std::ranges::range auto x, std::string s = "") requires(not std::is_same_v<decltype(x), std::string>) {
for (auto xi : x) { s += ", " + to_debug(xi); }
return "[" + s.substr(s.empty() ? 0 : 2) + "]";
}
template <class T, size_t size> std::string to_debug(T x, std::string s) requires(not std::ranges::range<T>) {
[&]<size_t... I>(std::index_sequence<I...>) { ((s += ", " + to_debug(get<I>(x))), ...); }(std::make_index_sequence<size>());
return "(" + s.substr(s.empty() ? 0 : 2) + ")";
}
#define debug(...) std::cerr << __FILE__ ":" << __LINE__ << ": (" #__VA_ARGS__ ") = " << to_debug(std::tuple(__VA_ARGS__)) << "\n"
void solve() {
int a, b, c, d, e, f;
std::cin >> a >> b >> c >> d >> e >> f;
int hi = a * c * e, lo = b * d * f;
if(hi != lo) {
std::cout << -1 << '\n';
return;
}
i64 x = f * d, y = e * d, z = e * c;
std::cout << (x + y > z and y + z > x and x + z > y ? 1 : -1) << '\n';
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int T = 1;
// std::cin >> T;
while(T -- ) {
solve();
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3576kb
input:
1 1 2 2 3 3
output:
1
result:
ok answer is '1'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
1 2 3 4 5 6
output:
-1
result:
ok answer is '-1'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
1 2 2 3 3 1
output:
-1
result:
ok answer is '-1'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
1000 1000 1000 1000 1000 1000
output:
1
result:
ok answer is '1'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
1000 999 999 998 499 500
output:
1
result:
ok answer is '1'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
1000 1 1 999 999 1000
output:
-1
result:
ok answer is '-1'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
8 15 15 82 82 8
output:
-1
result:
ok answer is '-1'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
772 445 445 943 943 772
output:
1
result:
ok answer is '1'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
325 775 202 497 629 447
output:
-1
result:
ok answer is '-1'
Test #10:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
922 60 60 990 990 922
output:
-1
result:
ok answer is '-1'
Test #11:
score: 0
Accepted
time: 0ms
memory: 3712kb
input:
932 156 156 974 974 932
output:
1
result:
ok answer is '1'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
211 918 739 857 537 728
output:
-1
result:
ok answer is '-1'
Test #13:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
773 40 40 980 980 773
output:
-1
result:
ok answer is '-1'
Test #14:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
868 568 568 951 951 868
output:
1
result:
ok answer is '1'
Test #15:
score: 0
Accepted
time: 0ms
memory: 3712kb
input:
310 991 449 593 263 940
output:
-1
result:
ok answer is '-1'
Test #16:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
495 108 108 685 685 495
output:
-1
result:
ok answer is '-1'
Test #17:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
757 580 580 854 854 757
output:
1
result:
ok answer is '1'
Test #18:
score: 0
Accepted
time: 0ms
memory: 3632kb
input:
80 221 355 676 328 934
output:
-1
result:
ok answer is '-1'
Test #19:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
988 5 5 999 999 988
output:
-1
result:
ok answer is '-1'
Test #20:
score: 0
Accepted
time: 0ms
memory: 3528kb
input:
467 67 67 530 530 467
output:
1
result:
ok answer is '1'
Test #21:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
980 965 34 835 504 691
output:
-1
result:
ok answer is '-1'
Test #22:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
882 115 115 997 997 882
output:
-1
result:
ok answer is '-1'
Test #23:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
325 152 152 335 335 325
output:
1
result:
ok answer is '1'
Test #24:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
399 489 22 896 153 302
output:
-1
result:
ok answer is '-1'
Test #25:
score: 0
Accepted
time: 0ms
memory: 3720kb
input:
340 406 406 897 897 340
output:
-1
result:
ok answer is '-1'
Test #26:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
968 502 502 970 970 968
output:
1
result:
ok answer is '1'
Test #27:
score: 0
Accepted
time: 0ms
memory: 3712kb
input:
328 694 10 84 792 475
output:
-1
result:
ok answer is '-1'
Test #28:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
919 8 8 929 929 919
output:
-1
result:
ok answer is '-1'
Test #29:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
643 480 480 819 819 643
output:
1
result:
ok answer is '1'
Test #30:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
925 607 197 420 492 951
output:
-1
result:
ok answer is '-1'
Test #31:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
352 141 141 666 666 352
output:
-1
result:
ok answer is '-1'
Test #32:
score: 0
Accepted
time: 0ms
memory: 3536kb
input:
986 200 200 999 999 986
output:
1
result:
ok answer is '1'
Test #33:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
559 858 881 806 620 483
output:
-1
result:
ok answer is '-1'
Test #34:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
564 6 6 763 763 564
output:
-1
result:
ok answer is '-1'
Test #35:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
325 962 962 963 963 325
output:
1
result:
ok answer is '1'
Test #36:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
595 832 549 327 464 279
output:
-1
result:
ok answer is '-1'
Test #37:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
282 70 70 366 366 282
output:
-1
result:
ok answer is '-1'
Test #38:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
992 639 639 995 995 992
output:
1
result:
ok answer is '1'
Test #39:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
466 600 581 958 989 467
output:
-1
result:
ok answer is '-1'
Test #40:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
519 20 20 801 801 519
output:
-1
result:
ok answer is '-1'
Test #41:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
770 581 581 793 793 770
output:
1
result:
ok answer is '1'
Test #42:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
552 898 335 807 628 718
output:
-1
result:
ok answer is '-1'
Test #43:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
2 3 3 1 1 2
output:
-1
result:
ok answer is '-1'
Extra Test:
score: 0
Extra Test Passed