commit
62d90d210c
39 changed files with 3397 additions and 0 deletions
-
1.gitignore
-
674LICENSE
-
2README.md
-
46download.py
-
39make_prob.py
-
6prob_maker/java.sh
-
6prob_maker/minjava.sh
-
6prob_maker/py.sh
-
6prob_maker/rb.sh
-
6prob_maker/rust.sh
-
6prob_maker/selfio.sh
-
6prob_maker/std.sh
-
49templates/java_template/Main.java
-
43templates/java_template/test.sh
-
22templates/minjava_template/Main.java
-
43templates/minjava_template/test.sh
-
11templates/python_template/main.py
-
39templates/python_template/test.sh
-
5templates/ruby_template/main.rb
-
39templates/ruby_template/test.sh
-
1templates/rust_template/.gitignore
-
5templates/rust_template/Cargo.lock
-
9templates/rust_template/Cargo.toml
-
28templates/rust_template/src/main.rs
-
45templates/rust_template/src/test.sh
-
26templates/selfio_template/Main.cpp
-
23templates/selfio_template/Makefile
-
146templates/selfio_template/bits/stdc++.h
-
861templates/selfio_template/ext/pb_ds/assoc_container.hpp
-
1templates/selfio_template/input/readme.txt
-
1templates/selfio_template/output/readme.txt
-
16templates/selfio_template/submit.sh
-
44templates/selfio_template/test.sh
-
23templates/std_template/Main.cpp
-
21templates/std_template/Makefile
-
146templates/std_template/bits/stdc++.h
-
46templates/std_template/download.py
-
861templates/std_template/ext/pb_ds/assoc_container.hpp
-
39templates/std_template/test.sh
@ -0,0 +1 @@ |
|||
.DS_Store |
|||
@ -0,0 +1,674 @@ |
|||
GNU GENERAL PUBLIC LICESE |
|||
Version 3, 29 June 2007 |
|||
|
|||
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/> |
|||
Everyone is permitted to copy and distribute verbatim copies |
|||
of this license document, but changing it is not allowed. |
|||
|
|||
Preamble |
|||
|
|||
The GNU General Public License is a free, copyleft license for |
|||
software and other kinds of works. |
|||
|
|||
The licenses for most software and other practical works are designed |
|||
to take away your freedom to share and change the works. By contrast, |
|||
the GNU General Public License is intended to guarantee your freedom to |
|||
share and change all versions of a program--to make sure it remains free |
|||
software for all its users. We, the Free Software Foundation, use the |
|||
GNU General Public License for most of our software; it applies also to |
|||
any other work released this way by its authors. You can apply it to |
|||
your programs, too. |
|||
|
|||
When we speak of free software, we are referring to freedom, not |
|||
price. Our General Public Licenses are designed to make sure that you |
|||
have the freedom to distribute copies of free software (and charge for |
|||
them if you wish), that you receive source code or can get it if you |
|||
want it, that you can change the software or use pieces of it in new |
|||
free programs, and that you know you can do these things. |
|||
|
|||
To protect your rights, we need to prevent others from denying you |
|||
these rights or asking you to surrender the rights. Therefore, you have |
|||
certain responsibilities if you distribute copies of the software, or if |
|||
you modify it: responsibilities to respect the freedom of others. |
|||
|
|||
For example, if you distribute copies of such a program, whether |
|||
gratis or for a fee, you must pass on to the recipients the same |
|||
freedoms that you received. You must make sure that they, too, receive |
|||
or can get the source code. And you must show them these terms so they |
|||
know their rights. |
|||
|
|||
Developers that use the GNU GPL protect your rights with two steps: |
|||
(1) assert copyright on the software, and (2) offer you this License |
|||
giving you legal permission to copy, distribute and/or modify it. |
|||
|
|||
For the developers' and authors' protection, the GPL clearly explains |
|||
that there is no warranty for this free software. For both users' and |
|||
authors' sake, the GPL requires that modified versions be marked as |
|||
changed, so that their problems will not be attributed erroneously to |
|||
authors of previous versions. |
|||
|
|||
Some devices are designed to deny users access to install or run |
|||
modified versions of the software inside them, although the manufacturer |
|||
can do so. This is fundamentally incompatible with the aim of |
|||
protecting users' freedom to change the software. The systematic |
|||
pattern of such abuse occurs in the area of products for individuals to |
|||
use, which is precisely where it is most unacceptable. Therefore, we |
|||
have designed this version of the GPL to prohibit the practice for those |
|||
products. If such problems arise substantially in other domains, we |
|||
stand ready to extend this provision to those domains in future versions |
|||
of the GPL, as needed to protect the freedom of users. |
|||
|
|||
Finally, every program is threatened constantly by software patents. |
|||
States should not allow patents to restrict development and use of |
|||
software on general-purpose computers, but in those that do, we wish to |
|||
avoid the special danger that patents applied to a free program could |
|||
make it effectively proprietary. To prevent this, the GPL assures that |
|||
patents cannot be used to render the program non-free. |
|||
|
|||
The precise terms and conditions for copying, distribution and |
|||
modification follow. |
|||
|
|||
TERMS AND CONDITIONS |
|||
|
|||
0. Definitions. |
|||
|
|||
"This License" refers to version 3 of the GNU General Public License. |
|||
|
|||
"Copyright" also means copyright-like laws that apply to other kinds of |
|||
works, such as semiconductor masks. |
|||
|
|||
"The Program" refers to any copyrightable work licensed under this |
|||
License. Each licensee is addressed as "you". "Licensees" and |
|||
"recipients" may be individuals or organizations. |
|||
|
|||
To "modify" a work means to copy from or adapt all or part of the work |
|||
in a fashion requiring copyright permission, other than the making of an |
|||
exact copy. The resulting work is called a "modified version" of the |
|||
earlier work or a work "based on" the earlier work. |
|||
|
|||
A "covered work" means either the unmodified Program or a work based |
|||
on the Program. |
|||
|
|||
To "propagate" a work means to do anything with it that, without |
|||
permission, would make you directly or secondarily liable for |
|||
infringement under applicable copyright law, except executing it on a |
|||
computer or modifying a private copy. Propagation includes copying, |
|||
distribution (with or without modification), making available to the |
|||
public, and in some countries other activities as well. |
|||
|
|||
To "convey" a work means any kind of propagation that enables other |
|||
parties to make or receive copies. Mere interaction with a user through |
|||
a computer network, with no transfer of a copy, is not conveying. |
|||
|
|||
An interactive user interface displays "Appropriate Legal Notices" |
|||
to the extent that it includes a convenient and prominently visible |
|||
feature that (1) displays an appropriate copyright notice, and (2) |
|||
tells the user that there is no warranty for the work (except to the |
|||
extent that warranties are provided), that licensees may convey the |
|||
work under this License, and how to view a copy of this License. If |
|||
the interface presents a list of user commands or options, such as a |
|||
menu, a prominent item in the list meets this criterion. |
|||
|
|||
1. Source Code. |
|||
|
|||
The "source code" for a work means the preferred form of the work |
|||
for making modifications to it. "Object code" means any non-source |
|||
form of a work. |
|||
|
|||
A "Standard Interface" means an interface that either is an official |
|||
standard defined by a recognized standards body, or, in the case of |
|||
interfaces specified for a particular programming language, one that |
|||
is widely used among developers working in that language. |
|||
|
|||
The "System Libraries" of an executable work include anything, other |
|||
than the work as a whole, that (a) is included in the normal form of |
|||
packaging a Major Component, but which is not part of that Major |
|||
Component, and (b) serves only to enable use of the work with that |
|||
Major Component, or to implement a Standard Interface for which an |
|||
implementation is available to the public in source code form. A |
|||
"Major Component", in this context, means a major essential component |
|||
(kernel, window system, and so on) of the specific operating system |
|||
(if any) on which the executable work runs, or a compiler used to |
|||
produce the work, or an object code interpreter used to run it. |
|||
|
|||
The "Corresponding Source" for a work in object code form means all |
|||
the source code needed to generate, install, and (for an executable |
|||
work) run the object code and to modify the work, including scripts to |
|||
control those activities. However, it does not include the work's |
|||
System Libraries, or general-purpose tools or generally available free |
|||
programs which are used unmodified in performing those activities but |
|||
which are not part of the work. For example, Corresponding Source |
|||
includes interface definition files associated with source files for |
|||
the work, and the source code for shared libraries and dynamically |
|||
linked subprograms that the work is specifically designed to require, |
|||
such as by intimate data communication or control flow between those |
|||
subprograms and other parts of the work. |
|||
|
|||
The Corresponding Source need not include anything that users |
|||
can regenerate automatically from other parts of the Corresponding |
|||
Source. |
|||
|
|||
The Corresponding Source for a work in source code form is that |
|||
same work. |
|||
|
|||
2. Basic Permissions. |
|||
|
|||
All rights granted under this License are granted for the term of |
|||
copyright on the Program, and are irrevocable provided the stated |
|||
conditions are met. This License explicitly affirms your unlimited |
|||
permission to run the unmodified Program. The output from running a |
|||
covered work is covered by this License only if the output, given its |
|||
content, constitutes a covered work. This License acknowledges your |
|||
rights of fair use or other equivalent, as provided by copyright law. |
|||
|
|||
You may make, run and propagate covered works that you do not |
|||
convey, without conditions so long as your license otherwise remains |
|||
in force. You may convey covered works to others for the sole purpose |
|||
of having them make modifications exclusively for you, or provide you |
|||
with facilities for running those works, provided that you comply with |
|||
the terms of this License in conveying all material for which you do |
|||
not control copyright. Those thus making or running the covered works |
|||
for you must do so exclusively on your behalf, under your direction |
|||
and control, on terms that prohibit them from making any copies of |
|||
your copyrighted material outside their relationship with you. |
|||
|
|||
Conveying under any other circumstances is permitted solely under |
|||
the conditions stated below. Sublicensing is not allowed; section 10 |
|||
makes it unnecessary. |
|||
|
|||
3. Protecting Users' Legal Rights From Anti-Circumvention Law. |
|||
|
|||
No covered work shall be deemed part of an effective technological |
|||
measure under any applicable law fulfilling obligations under article |
|||
11 of the WIPO copyright treaty adopted on 20 December 1996, or |
|||
similar laws prohibiting or restricting circumvention of such |
|||
measures. |
|||
|
|||
When you convey a covered work, you waive any legal power to forbid |
|||
circumvention of technological measures to the extent such circumvention |
|||
is effected by exercising rights under this License with respect to |
|||
the covered work, and you disclaim any intention to limit operation or |
|||
modification of the work as a means of enforcing, against the work's |
|||
users, your or third parties' legal rights to forbid circumvention of |
|||
technological measures. |
|||
|
|||
4. Conveying Verbatim Copies. |
|||
|
|||
You may convey verbatim copies of the Program's source code as you |
|||
receive it, in any medium, provided that you conspicuously and |
|||
appropriately publish on each copy an appropriate copyright notice; |
|||
keep intact all notices stating that this License and any |
|||
non-permissive terms added in accord with section 7 apply to the code; |
|||
keep intact all notices of the absence of any warranty; and give all |
|||
recipients a copy of this License along with the Program. |
|||
|
|||
You may charge any price or no price for each copy that you convey, |
|||
and you may offer support or warranty protection for a fee. |
|||
|
|||
5. Conveying Modified Source Versions. |
|||
|
|||
You may convey a work based on the Program, or the modifications to |
|||
produce it from the Program, in the form of source code under the |
|||
terms of section 4, provided that you also meet all of these conditions: |
|||
|
|||
a) The work must carry prominent notices stating that you modified |
|||
it, and giving a relevant date. |
|||
|
|||
b) The work must carry prominent notices stating that it is |
|||
released under this License and any conditions added under section |
|||
7. This requirement modifies the requirement in section 4 to |
|||
"keep intact all notices". |
|||
|
|||
c) You must license the entire work, as a whole, under this |
|||
License to anyone who comes into possession of a copy. This |
|||
License will therefore apply, along with any applicable section 7 |
|||
additional terms, to the whole of the work, and all its parts, |
|||
regardless of how they are packaged. This License gives no |
|||
permission to license the work in any other way, but it does not |
|||
invalidate such permission if you have separately received it. |
|||
|
|||
d) If the work has interactive user interfaces, each must display |
|||
Appropriate Legal Notices; however, if the Program has interactive |
|||
interfaces that do not display Appropriate Legal Notices, your |
|||
work need not make them do so. |
|||
|
|||
A compilation of a covered work with other separate and independent |
|||
works, which are not by their nature extensions of the covered work, |
|||
and which are not combined with it such as to form a larger program, |
|||
in or on a volume of a storage or distribution medium, is called an |
|||
"aggregate" if the compilation and its resulting copyright are not |
|||
used to limit the access or legal rights of the compilation's users |
|||
beyond what the individual works permit. Inclusion of a covered work |
|||
in an aggregate does not cause this License to apply to the other |
|||
parts of the aggregate. |
|||
|
|||
6. Conveying Non-Source Forms. |
|||
|
|||
You may convey a covered work in object code form under the terms |
|||
of sections 4 and 5, provided that you also convey the |
|||
machine-readable Corresponding Source under the terms of this License, |
|||
in one of these ways: |
|||
|
|||
a) Convey the object code in, or embodied in, a physical product |
|||
(including a physical distribution medium), accompanied by the |
|||
Corresponding Source fixed on a durable physical medium |
|||
customarily used for software interchange. |
|||
|
|||
b) Convey the object code in, or embodied in, a physical product |
|||
(including a physical distribution medium), accompanied by a |
|||
written offer, valid for at least three years and valid for as |
|||
long as you offer spare parts or customer support for that product |
|||
model, to give anyone who possesses the object code either (1) a |
|||
copy of the Corresponding Source for all the software in the |
|||
product that is covered by this License, on a durable physical |
|||
medium customarily used for software interchange, for a price no |
|||
more than your reasonable cost of physically performing this |
|||
conveying of source, or (2) access to copy the |
|||
Corresponding Source from a network server at no charge. |
|||
|
|||
c) Convey individual copies of the object code with a copy of the |
|||
written offer to provide the Corresponding Source. This |
|||
alternative is allowed only occasionally and noncommercially, and |
|||
only if you received the object code with such an offer, in accord |
|||
with subsection 6b. |
|||
|
|||
d) Convey the object code by offering access from a designated |
|||
place (gratis or for a charge), and offer equivalent access to the |
|||
Corresponding Source in the same way through the same place at no |
|||
further charge. You need not require recipients to copy the |
|||
Corresponding Source along with the object code. If the place to |
|||
copy the object code is a network server, the Corresponding Source |
|||
may be on a different server (operated by you or a third party) |
|||
that supports equivalent copying facilities, provided you maintain |
|||
clear directions next to the object code saying where to find the |
|||
Corresponding Source. Regardless of what server hosts the |
|||
Corresponding Source, you remain obligated to ensure that it is |
|||
available for as long as needed to satisfy these requirements. |
|||
|
|||
e) Convey the object code using peer-to-peer transmission, provided |
|||
you inform other peers where the object code and Corresponding |
|||
Source of the work are being offered to the general public at no |
|||
charge under subsection 6d. |
|||
|
|||
A separable portion of the object code, whose source code is excluded |
|||
from the Corresponding Source as a System Library, need not be |
|||
included in conveying the object code work. |
|||
|
|||
A "User Product" is either (1) a "consumer product", which means any |
|||
tangible personal property which is normally used for personal, family, |
|||
or household purposes, or (2) anything designed or sold for incorporation |
|||
into a dwelling. In determining whether a product is a consumer product, |
|||
doubtful cases shall be resolved in favor of coverage. For a particular |
|||
product received by a particular user, "normally used" refers to a |
|||
typical or common use of that class of product, regardless of the status |
|||
of the particular user or of the way in which the particular user |
|||
actually uses, or expects or is expected to use, the product. A product |
|||
is a consumer product regardless of whether the product has substantial |
|||
commercial, industrial or non-consumer uses, unless such uses represent |
|||
the only significant mode of use of the product. |
|||
|
|||
"Installation Information" for a User Product means any methods, |
|||
procedures, authorization keys, or other information required to install |
|||
and execute modified versions of a covered work in that User Product from |
|||
a modified version of its Corresponding Source. The information must |
|||
suffice to ensure that the continued functioning of the modified object |
|||
code is in no case prevented or interfered with solely because |
|||
modification has been made. |
|||
|
|||
If you convey an object code work under this section in, or with, or |
|||
specifically for use in, a User Product, and the conveying occurs as |
|||
part of a transaction in which the right of possession and use of the |
|||
User Product is transferred to the recipient in perpetuity or for a |
|||
fixed term (regardless of how the transaction is characterized), the |
|||
Corresponding Source conveyed under this section must be accompanied |
|||
by the Installation Information. But this requirement does not apply |
|||
if neither you nor any third party retains the ability to install |
|||
modified object code on the User Product (for example, the work has |
|||
been installed in ROM). |
|||
|
|||
The requirement to provide Installation Information does not include a |
|||
requirement to continue to provide support service, warranty, or updates |
|||
for a work that has been modified or installed by the recipient, or for |
|||
the User Product in which it has been modified or installed. Access to a |
|||
network may be denied when the modification itself materially and |
|||
adversely affects the operation of the network or violates the rules and |
|||
protocols for communication across the network. |
|||
|
|||
Corresponding Source conveyed, and Installation Information provided, |
|||
in accord with this section must be in a format that is publicly |
|||
documented (and with an implementation available to the public in |
|||
source code form), and must require no special password or key for |
|||
unpacking, reading or copying. |
|||
|
|||
7. Additional Terms. |
|||
|
|||
"Additional permissions" are terms that supplement the terms of this |
|||
License by making exceptions from one or more of its conditions. |
|||
Additional permissions that are applicable to the entire Program shall |
|||
be treated as though they were included in this License, to the extent |
|||
that they are valid under applicable law. If additional permissions |
|||
apply only to part of the Program, that part may be used separately |
|||
under those permissions, but the entire Program remains governed by |
|||
this License without regard to the additional permissions. |
|||
|
|||
When you convey a copy of a covered work, you may at your option |
|||
remove any additional permissions from that copy, or from any part of |
|||
it. (Additional permissions may be written to require their own |
|||
removal in certain cases when you modify the work.) You may place |
|||
additional permissions on material, added by you to a covered work, |
|||
for which you have or can give appropriate copyright permission. |
|||
|
|||
Notwithstanding any other provision of this License, for material you |
|||
add to a covered work, you may (if authorized by the copyright holders of |
|||
that material) supplement the terms of this License with terms: |
|||
|
|||
a) Disclaiming warranty or limiting liability differently from the |
|||
terms of sections 15 and 16 of this License; or |
|||
|
|||
b) Requiring preservation of specified reasonable legal notices or |
|||
author attributions in that material or in the Appropriate Legal |
|||
Notices displayed by works containing it; or |
|||
|
|||
c) Prohibiting misrepresentation of the origin of that material, or |
|||
requiring that modified versions of such material be marked in |
|||
reasonable ways as different from the original version; or |
|||
|
|||
d) Limiting the use for publicity purposes of names of licensors or |
|||
authors of the material; or |
|||
|
|||
e) Declining to grant rights under trademark law for use of some |
|||
trade names, trademarks, or service marks; or |
|||
|
|||
f) Requiring indemnification of licensors and authors of that |
|||
material by anyone who conveys the material (or modified versions of |
|||
it) with contractual assumptions of liability to the recipient, for |
|||
any liability that these contractual assumptions directly impose on |
|||
those licensors and authors. |
|||
|
|||
All other non-permissive additional terms are considered "further |
|||
restrictions" within the meaning of section 10. If the Program as you |
|||
received it, or any part of it, contains a notice stating that it is |
|||
governed by this License along with a term that is a further |
|||
restriction, you may remove that term. If a license document contains |
|||
a further restriction but permits relicensing or conveying under this |
|||
License, you may add to a covered work material governed by the terms |
|||
of that license document, provided that the further restriction does |
|||
not survive such relicensing or conveying. |
|||
|
|||
If you add terms to a covered work in accord with this section, you |
|||
must place, in the relevant source files, a statement of the |
|||
additional terms that apply to those files, or a notice indicating |
|||
where to find the applicable terms. |
|||
|
|||
Additional terms, permissive or non-permissive, may be stated in the |
|||
form of a separately written license, or stated as exceptions; |
|||
the above requirements apply either way. |
|||
|
|||
8. Termination. |
|||
|
|||
You may not propagate or modify a covered work except as expressly |
|||
provided under this License. Any attempt otherwise to propagate or |
|||
modify it is void, and will automatically terminate your rights under |
|||
this License (including any patent licenses granted under the third |
|||
paragraph of section 11). |
|||
|
|||
However, if you cease all violation of this License, then your |
|||
license from a particular copyright holder is reinstated (a) |
|||
provisionally, unless and until the copyright holder explicitly and |
|||
finally terminates your license, and (b) permanently, if the copyright |
|||
holder fails to notify you of the violation by some reasonable means |
|||
prior to 60 days after the cessation. |
|||
|
|||
Moreover, your license from a particular copyright holder is |
|||
reinstated permanently if the copyright holder notifies you of the |
|||
violation by some reasonable means, this is the first time you have |
|||
received notice of violation of this License (for any work) from that |
|||
copyright holder, and you cure the violation prior to 30 days after |
|||
your receipt of the notice. |
|||
|
|||
Termination of your rights under this section does not terminate the |
|||
licenses of parties who have received copies or rights from you under |
|||
this License. If your rights have been terminated and not permanently |
|||
reinstated, you do not qualify to receive new licenses for the same |
|||
material under section 10. |
|||
|
|||
9. Acceptance Not Required for Having Copies. |
|||
|
|||
You are not required to accept this License in order to receive or |
|||
run a copy of the Program. Ancillary propagation of a covered work |
|||
occurring solely as a consequence of using peer-to-peer transmission |
|||
to receive a copy likewise does not require acceptance. However, |
|||
nothing other than this License grants you permission to propagate or |
|||
modify any covered work. These actions infringe copyright if you do |
|||
not accept this License. Therefore, by modifying or propagating a |
|||
covered work, you indicate your acceptance of this License to do so. |
|||
|
|||
10. Automatic Licensing of Downstream Recipients. |
|||
|
|||
Each time you convey a covered work, the recipient automatically |
|||
receives a license from the original licensors, to run, modify and |
|||
propagate that work, subject to this License. You are not responsible |
|||
for enforcing compliance by third parties with this License. |
|||
|
|||
An "entity transaction" is a transaction transferring control of an |
|||
organization, or substantially all assets of one, or subdividing an |
|||
organization, or merging organizations. If propagation of a covered |
|||
work results from an entity transaction, each party to that |
|||
transaction who receives a copy of the work also receives whatever |
|||
licenses to the work the party's predecessor in interest had or could |
|||
give under the previous paragraph, plus a right to possession of the |
|||
Corresponding Source of the work from the predecessor in interest, if |
|||
the predecessor has it or can get it with reasonable efforts. |
|||
|
|||
You may not impose any further restrictions on the exercise of the |
|||
rights granted or affirmed under this License. For example, you may |
|||
not impose a license fee, royalty, or other charge for exercise of |
|||
rights granted under this License, and you may not initiate litigation |
|||
(including a cross-claim or counterclaim in a lawsuit) alleging that |
|||
any patent claim is infringed by making, using, selling, offering for |
|||
sale, or importing the Program or any portion of it. |
|||
|
|||
11. Patents. |
|||
|
|||
A "contributor" is a copyright holder who authorizes use under this |
|||
License of the Program or a work on which the Program is based. The |
|||
work thus licensed is called the contributor's "contributor version". |
|||
|
|||
A contributor's "essential patent claims" are all patent claims |
|||
owned or controlled by the contributor, whether already acquired or |
|||
hereafter acquired, that would be infringed by some manner, permitted |
|||
by this License, of making, using, or selling its contributor version, |
|||
but do not include claims that would be infringed only as a |
|||
consequence of further modification of the contributor version. For |
|||
purposes of this definition, "control" includes the right to grant |
|||
patent sublicenses in a manner consistent with the requirements of |
|||
this License. |
|||
|
|||
Each contributor grants you a non-exclusive, worldwide, royalty-free |
|||
patent license under the contributor's essential patent claims, to |
|||
make, use, sell, offer for sale, import and otherwise run, modify and |
|||
propagate the contents of its contributor version. |
|||
|
|||
In the following three paragraphs, a "patent license" is any express |
|||
agreement or commitment, however denominated, not to enforce a patent |
|||
(such as an express permission to practice a patent or covenant not to |
|||
sue for patent infringement). To "grant" such a patent license to a |
|||
party means to make such an agreement or commitment not to enforce a |
|||
patent against the party. |
|||
|
|||
If you convey a covered work, knowingly relying on a patent license, |
|||
and the Corresponding Source of the work is not available for anyone |
|||
to copy, free of charge and under the terms of this License, through a |
|||
publicly available network server or other readily accessible means, |
|||
then you must either (1) cause the Corresponding Source to be so |
|||
available, or (2) arrange to deprive yourself of the benefit of the |
|||
patent license for this particular work, or (3) arrange, in a manner |
|||
consistent with the requirements of this License, to extend the patent |
|||
license to downstream recipients. "Knowingly relying" means you have |
|||
actual knowledge that, but for the patent license, your conveying the |
|||
covered work in a country, or your recipient's use of the covered work |
|||
in a country, would infringe one or more identifiable patents in that |
|||
country that you have reason to believe are valid. |
|||
|
|||
If, pursuant to or in connection with a single transaction or |
|||
arrangement, you convey, or propagate by procuring conveyance of, a |
|||
covered work, and grant a patent license to some of the parties |
|||
receiving the covered work authorizing them to use, propagate, modify |
|||
or convey a specific copy of the covered work, then the patent license |
|||
you grant is automatically extended to all recipients of the covered |
|||
work and works based on it. |
|||
|
|||
A patent license is "discriminatory" if it does not include within |
|||
the scope of its coverage, prohibits the exercise of, or is |
|||
conditioned on the non-exercise of one or more of the rights that are |
|||
specifically granted under this License. You may not convey a covered |
|||
work if you are a party to an arrangement with a third party that is |
|||
in the business of distributing software, under which you make payment |
|||
to the third party based on the extent of your activity of conveying |
|||
the work, and under which the third party grants, to any of the |
|||
parties who would receive the covered work from you, a discriminatory |
|||
patent license (a) in connection with copies of the covered work |
|||
conveyed by you (or copies made from those copies), or (b) primarily |
|||
for and in connection with specific products or compilations that |
|||
contain the covered work, unless you entered into that arrangement, |
|||
or that patent license was granted, prior to 28 March 2007. |
|||
|
|||
Nothing in this License shall be construed as excluding or limiting |
|||
any implied license or other defenses to infringement that may |
|||
otherwise be available to you under applicable patent law. |
|||
|
|||
12. No Surrender of Others' Freedom. |
|||
|
|||
If conditions are imposed on you (whether by court order, agreement or |
|||
otherwise) that contradict the conditions of this License, they do not |
|||
excuse you from the conditions of this License. If you cannot convey a |
|||
covered work so as to satisfy simultaneously your obligations under this |
|||
License and any other pertinent obligations, then as a consequence you may |
|||
not convey it at all. For example, if you agree to terms that obligate you |
|||
to collect a royalty for further conveying from those to whom you convey |
|||
the Program, the only way you could satisfy both those terms and this |
|||
License would be to refrain entirely from conveying the Program. |
|||
|
|||
13. Use with the GNU Affero General Public License. |
|||
|
|||
Notwithstanding any other provision of this License, you have |
|||
permission to link or combine any covered work with a work licensed |
|||
under version 3 of the GNU Affero General Public License into a single |
|||
combined work, and to convey the resulting work. The terms of this |
|||
License will continue to apply to the part which is the covered work, |
|||
but the special requirements of the GNU Affero General Public License, |
|||
section 13, concerning interaction through a network will apply to the |
|||
combination as such. |
|||
|
|||
14. Revised Versions of this License. |
|||
|
|||
The Free Software Foundation may publish revised and/or new versions of |
|||
the GNU General Public License from time to time. Such new versions will |
|||
be similar in spirit to the present version, but may differ in detail to |
|||
address new problems or concerns. |
|||
|
|||
Each version is given a distinguishing version number. If the |
|||
Program specifies that a certain numbered version of the GNU General |
|||
Public License "or any later version" applies to it, you have the |
|||
option of following the terms and conditions either of that numbered |
|||
version or of any later version published by the Free Software |
|||
Foundation. If the Program does not specify a version number of the |
|||
GNU General Public License, you may choose any version ever published |
|||
by the Free Software Foundation. |
|||
|
|||
If the Program specifies that a proxy can decide which future |
|||
versions of the GNU General Public License can be used, that proxy's |
|||
public statement of acceptance of a version permanently authorizes you |
|||
to choose that version for the Program. |
|||
|
|||
Later license versions may give you additional or different |
|||
permissions. However, no additional obligations are imposed on any |
|||
author or copyright holder as a result of your choosing to follow a |
|||
later version. |
|||
|
|||
15. Disclaimer of Warranty. |
|||
|
|||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY |
|||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT |
|||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY |
|||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, |
|||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
|||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM |
|||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF |
|||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION. |
|||
|
|||
16. Limitation of Liability. |
|||
|
|||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING |
|||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS |
|||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY |
|||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE |
|||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF |
|||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD |
|||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), |
|||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF |
|||
SUCH DAMAGES. |
|||
|
|||
17. Interpretation of Sections 15 and 16. |
|||
|
|||
If the disclaimer of warranty and limitation of liability provided |
|||
above cannot be given local legal effect according to their terms, |
|||
reviewing courts shall apply local law that most closely approximates |
|||
an absolute waiver of all civil liability in connection with the |
|||
Program, unless a warranty or assumption of liability accompanies a |
|||
copy of the Program in return for a fee. |
|||
|
|||
END OF TERMS AND CONDITIONS |
|||
|
|||
How to Apply These Terms to Your New Programs |
|||
|
|||
If you develop a new program, and you want it to be of the greatest |
|||
possible use to the public, the best way to achieve this is to make it |
|||
free software which everyone can redistribute and change under these terms. |
|||
|
|||
To do so, attach the following notices to the program. It is safest |
|||
to attach them to the start of each source file to most effectively |
|||
state the exclusion of warranty; and each file should have at least |
|||
the "copyright" line and a pointer to where the full notice is found. |
|||
|
|||
<one line to give the program's name and a brief idea of what it does.> |
|||
Copyright (C) <year> <name of author> |
|||
|
|||
This program is free software: you can redistribute it and/or modify |
|||
it under the terms of the GNU General Public License as published by |
|||
the Free Software Foundation, either version 3 of the License, or |
|||
(at your option) any later version. |
|||
|
|||
This program is distributed in the hope that it will be useful, |
|||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
|||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|||
GNU General Public License for more details. |
|||
|
|||
You should have received a copy of the GNU General Public License |
|||
along with this program. If not, see <https://www.gnu.org/licenses/>. |
|||
|
|||
Also add information on how to contact you by electronic and paper mail. |
|||
|
|||
If the program does terminal interaction, make it output a short |
|||
notice like this when it starts in an interactive mode: |
|||
|
|||
<program> Copyright (C) <year> <name of author> |
|||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. |
|||
This is free software, and you are welcome to redistribute it |
|||
under certain conditions; type `show c' for details. |
|||
|
|||
The hypothetical commands `show w' and `show c' should show the appropriate |
|||
parts of the General Public License. Of course, your program's commands |
|||
might be different; for a GUI interface, you would use an "about box". |
|||
|
|||
You should also get your employer (if you work as a programmer) or school, |
|||
if any, to sign a "copyright disclaimer" for the program, if necessary. |
|||
For more information on this, and how to apply and follow the GNU GPL, see |
|||
<https://www.gnu.org/licenses/>. |
|||
|
|||
The GNU General Public License does not permit incorporating your program |
|||
into proprietary programs. If your program is a subroutine library, you |
|||
may consider it more useful to permit linking proprietary applications with |
|||
the library. If this is what you want to do, use the GNU Lesser General |
|||
Public License instead of this License. But first, please read |
|||
<https://www.gnu.org/licenses/why-not-lgpl.html>. |
|||
@ -0,0 +1,2 @@ |
|||
# mincp |
|||
2.0 version of mincp |
|||
@ -0,0 +1,46 @@ |
|||
#!/usr/bin/env python3 |
|||
import os |
|||
import sys |
|||
import http.server |
|||
import subprocess |
|||
import json |
|||
|
|||
#script to download sample cases. |
|||
|
|||
def listen(*, timeout=None): |
|||
json_data = None |
|||
class CompetitiveCompanionHandler(http.server.BaseHTTPRequestHandler): |
|||
def do_POST(self): |
|||
nonlocal json_data |
|||
json_data = json.load(self.rfile) |
|||
|
|||
with http.server.HTTPServer(('127.0.0.1', 10046), CompetitiveCompanionHandler) as server: |
|||
server.timeout = timeout |
|||
server.handle_request() |
|||
if json_data is None: |
|||
print("failed") |
|||
print(json_data) |
|||
return json_data |
|||
|
|||
def create_tests(): |
|||
prob = listen() |
|||
#prob is a dictionary containing all of json data |
|||
if prob is None: |
|||
return |
|||
cnt = 1 |
|||
for test in prob["tests"]: |
|||
#create a .in and .out file |
|||
name = "Sample" + str(cnt) |
|||
#create new files and write the required cases to there. |
|||
os.system("touch " + name + ".in") |
|||
os.system("touch " + name + ".out") |
|||
|
|||
with open(name + ".in", "w") as inp: |
|||
inp.write(test["input"]) |
|||
|
|||
with open(name + ".out", "w") as op: |
|||
op.write(test["output"]) |
|||
|
|||
cnt += 1 |
|||
|
|||
create_tests() |
|||
@ -0,0 +1,39 @@ |
|||
#!/usr/bin/env python3 |
|||
import argparse |
|||
import os |
|||
import subprocess |
|||
import shutil |
|||
|
|||
# set up this in order to point to proper directory. |
|||
setup_dir = "/home/junikim/cp" |
|||
os.environ["CP_SETUP_DIR"] = setup_dir |
|||
|
|||
parser = argparse.ArgumentParser() |
|||
|
|||
templates = ["py", "std", "selfio", "java", "minjava", "rb", "rust"] |
|||
|
|||
def file_option(): |
|||
global parser |
|||
for s in templates: |
|||
parser.add_argument("-" + s, default=[], type=str, nargs="*") |
|||
|
|||
def add_download(filename, prefix=""): |
|||
global setup_dir |
|||
template = os.path.join(setup_dir, prefix, "download.py") |
|||
script = os.path.join(filename, prefix, "download.py") |
|||
shutil.copyfile(template, script) |
|||
os.system(f"chmod +x {script}") |
|||
|
|||
""" |
|||
in order to make a new template, add it to file_option, |
|||
create a new script in prob_maker, and then call as below. |
|||
""" |
|||
|
|||
file_option() |
|||
problems = parser.parse_args() |
|||
|
|||
for t in templates: |
|||
for filename in problems.__dict__[t]: |
|||
subprocess.call(["bash", os.path.join(setup_dir, "prob_maker", t + ".sh"), filename]) |
|||
prefix = "src" if t == "rust" else "" |
|||
add_download(filename, prefix=prefix) |
|||
@ -0,0 +1,6 @@ |
|||
FILE=$1 |
|||
|
|||
[ -f "$FILE.java" ] && exit 1 |
|||
cp -r "$CP_SETUP_DIR/templates/java_template" . |
|||
NAME=$1 |
|||
mv java_template $NAME |
|||
@ -0,0 +1,6 @@ |
|||
FILE=$1 |
|||
|
|||
[ -f "$FILE.java" ] && exit 1 |
|||
cp -r "$CP_SETUP_DIR/templates/minjava_template" . |
|||
NAME=$1 |
|||
mv minjava_template $NAME |
|||
@ -0,0 +1,6 @@ |
|||
FILE=$1 |
|||
|
|||
[ -f "$FILE.py" ] && exit 1 |
|||
cp -r "$CP_SETUP_DIR/templates/python_template" . |
|||
NAME=$1 |
|||
mv python_template $NAME |
|||
@ -0,0 +1,6 @@ |
|||
FILE=$1 |
|||
|
|||
[ -f "$FILE.py" ] && exit 1 |
|||
cp -r "$CP_SETUP_DIR/templates/ruby_template" . |
|||
NAME=$1 |
|||
mv ruby_template $NAME |
|||
@ -0,0 +1,6 @@ |
|||
FILE=$1 |
|||
|
|||
[ -f "$FILE.rs" ] && exit 1 |
|||
cp -r "$CP_SETUP_DIR/templates/rust_template" . |
|||
NAME=$1 |
|||
mv rust_template $NAME |
|||
@ -0,0 +1,6 @@ |
|||
FILE=$1 |
|||
|
|||
[ -f "$FILE.cpp" ] && exit 1 |
|||
cp -r "$CP_SETUP_DIR/templates/selfio_template" . |
|||
NAME=$1 |
|||
mv selfio_template $NAME |
|||
@ -0,0 +1,6 @@ |
|||
FILE=$1 |
|||
|
|||
[ -f "$FILE.cpp" ] && exit 1 |
|||
cp -r "$CP_SETUP_DIR/templates/std_template" . |
|||
NAME=$1 |
|||
mv std_template $NAME |
|||
@ -0,0 +1,49 @@ |
|||
import java.io.*; |
|||
import java.util.*; |
|||
|
|||
public class Main { |
|||
static PrintWriter out; |
|||
static class FIO { |
|||
BufferedReader in; |
|||
StringTokenizer st; |
|||
FIO() throws IOException { |
|||
in = new BufferedReader(new InputStreamReader(System.in)); |
|||
out = new PrintWriter(System.out); |
|||
} |
|||
FIO(String name) throws IOException { |
|||
in = new BufferedReader(new FileReader(name + ".in")); |
|||
out = new PrintWriter(new FileWriter(name + ".out")); |
|||
} |
|||
String next() { |
|||
while (st == null || !st.hasMoreTokens()) { |
|||
try { |
|||
st = new StringTokenizer(in.readLine()); |
|||
} catch (IOException e) { |
|||
e.printStackTrace(); |
|||
} |
|||
} |
|||
return st.nextToken(); |
|||
} |
|||
int ni() { |
|||
return Integer.parseInt(next()); |
|||
} |
|||
long nl() { |
|||
return Long.parseLong(next()); |
|||
} |
|||
double nd() { |
|||
return Double.parseDouble(next()); |
|||
} |
|||
} |
|||
static FIO in; |
|||
public static void main (String[] args) throws IOException { |
|||
in = new FIO(); |
|||
new solver(); |
|||
out.close(); |
|||
} |
|||
static class solver { |
|||
solver() { |
|||
|
|||
} |
|||
} |
|||
} |
|||
|
|||
@ -0,0 +1,43 @@ |
|||
#!/bin/bash |
|||
PROG="Main" |
|||
|
|||
# compilation stage. |
|||
javac $PROG.java |
|||
if [ $? -ne 0 ]; then |
|||
exit 1 |
|||
fi |
|||
|
|||
# diffing program output against actual output. (modified for java) |
|||
for i in *.in; do |
|||
name=`echo $i|sed "s/.in//"` |
|||
echo -e "running test: $name \n" |
|||
echo -e "INPUT:" |
|||
cat $name.in |
|||
|
|||
echo -e "\nOUTPUT:" |
|||
# clearing the .res files. |
|||
if [ -f $name.res ]; then |
|||
rm $name.res |
|||
fi |
|||
touch $name.res |
|||
timeout 5s java $PROG < $name.in > $name.res |
|||
if [ $? -eq 124 ]; then |
|||
echo -e "time limit exceeded." |
|||
rm -rf $name.res |
|||
exit 1 |
|||
fi |
|||
if [ $? -ne 0 ]; then |
|||
exit 1 |
|||
fi |
|||
|
|||
cat $name.res |
|||
if [ -f $name.out ]; then |
|||
echo -e "ANSWER:" |
|||
cat $name.out |
|||
echo -e "\nDIFF:" |
|||
diff $name.res $name.out |
|||
fi |
|||
echo "___________________________________" |
|||
echo -e "\n" |
|||
done |
|||
exit 0 |
|||
@ -0,0 +1,22 @@ |
|||
import java.io.*; |
|||
import java.util.*; |
|||
|
|||
public class Main { |
|||
static BufferedReader in; |
|||
static PrintWriter out; |
|||
static StringTokenizer st; |
|||
public static void main(String[] args) throws IOException { |
|||
in = new BufferedReader(new InputStreamReader(System.in)); |
|||
out = new PrintWriter(System.out); |
|||
new solver(); |
|||
out.close(); |
|||
} |
|||
static void line() throws IOException { |
|||
st = new StringTokenizer(in.readLine()); |
|||
} |
|||
static class solver { |
|||
solver() throws IOException { |
|||
line(); |
|||
} |
|||
} |
|||
} |
|||
@ -0,0 +1,43 @@ |
|||
#!/bin/bash |
|||
PROG="Main" |
|||
|
|||
# compilation stage. |
|||
javac $PROG.java |
|||
if [ $? -ne 0 ]; then |
|||
exit 1 |
|||
fi |
|||
|
|||
# diffing program output against actual output. (modified for java) |
|||
for i in *.in; do |
|||
name=`echo $i|sed "s/.in//"` |
|||
echo -e "running test: $name \n" |
|||
echo -e "INPUT:" |
|||
cat $name.in |
|||
|
|||
echo -e "\nOUTPUT:" |
|||
# clearing the .res files. |
|||
if [ -f $name.res ]; then |
|||
rm $name.res |
|||
fi |
|||
touch $name.res |
|||
timeout 5s java $PROG < $name.in > $name.res |
|||
if [ $? -eq 124 ]; then |
|||
echo -e "time limit exceeded." |
|||
rm -rf $name.res |
|||
exit 1 |
|||
fi |
|||
if [ $? -ne 0 ]; then |
|||
exit 1 |
|||
fi |
|||
|
|||
cat $name.res |
|||
if [ -f $name.out ]; then |
|||
echo -e "ANSWER:" |
|||
cat $name.out |
|||
echo -e "\nDIFF:" |
|||
diff $name.res $name.out |
|||
fi |
|||
echo "___________________________________" |
|||
echo -e "\n" |
|||
done |
|||
exit 0 |
|||
@ -0,0 +1,11 @@ |
|||
import math |
|||
import sys |
|||
|
|||
r = sys.stdin |
|||
w = sys.stdout |
|||
|
|||
def main(): |
|||
pass |
|||
|
|||
if __name__ == "__main__": |
|||
main() |
|||
@ -0,0 +1,39 @@ |
|||
#!/bin/bash |
|||
PROG="main" |
|||
|
|||
# diffing program output against actual output. |
|||
for i in *.in; do |
|||
name=`echo $i|sed "s/.in//"` |
|||
echo -e "running test: $name \n" |
|||
echo -e "INPUT:" |
|||
cat $name.in |
|||
|
|||
echo -e "\nOUTPUT:" |
|||
# clearing the .res files. |
|||
if [ -f $name.res ]; then |
|||
rm $name.res |
|||
fi |
|||
touch $name.res |
|||
timeout 5s python3 $PROG.py < $name.in > $name.res; |
|||
if [ $? -eq 124 ]; then |
|||
echo -e "time limit exceeded." |
|||
rm -rf $name.res |
|||
exit 1 |
|||
fi |
|||
|
|||
if [ $? -ne 0 ]; then |
|||
echo -e "runtime error" |
|||
exit 1 |
|||
fi |
|||
|
|||
cat $name.res |
|||
if [ -f $name.out ]; then |
|||
echo -e "ANSWER:" |
|||
cat $name.out |
|||
echo -e "\nDIFF:" |
|||
diff $name.res $name.out |
|||
fi |
|||
echo "___________________________________" |
|||
echo -e "\n" |
|||
done |
|||
exit 0 |
|||
@ -0,0 +1,5 @@ |
|||
#!/usr/bin/env ruby |
|||
|
|||
def arline |
|||
gets.chomp.split.map(&:to_i) |
|||
end |
|||
@ -0,0 +1,39 @@ |
|||
#!/bin/bash |
|||
PROG="main" |
|||
|
|||
# diffing program output against actual output. |
|||
for i in *.in; do |
|||
name=`echo $i|sed "s/.in//"` |
|||
echo -e "running test: $name \n" |
|||
echo -e "INPUT:" |
|||
cat $name.in |
|||
|
|||
echo -e "\nOUTPUT:" |
|||
# clearing the .res files. |
|||
if [ -f $name.res ]; then |
|||
rm $name.res |
|||
fi |
|||
touch $name.res |
|||
timeout 5s ruby $PROG.rb < $name.in > $name.res; |
|||
if [ $? -eq 124 ]; then |
|||
echo -e "time limit exceeded." |
|||
rm -rf $name.res |
|||
exit 1 |
|||
fi |
|||
|
|||
if [ $? -ne 0 ]; then |
|||
echo -e "runtime error" |
|||
exit 1 |
|||
fi |
|||
|
|||
cat $name.res |
|||
if [ -f $name.out ]; then |
|||
echo -e "ANSWER:" |
|||
cat $name.out |
|||
echo -e "\nDIFF:" |
|||
diff $name.res $name.out |
|||
fi |
|||
echo "___________________________________" |
|||
echo -e "\n" |
|||
done |
|||
exit 0 |
|||
@ -0,0 +1 @@ |
|||
/target |
|||
@ -0,0 +1,5 @@ |
|||
# This file is automatically @generated by Cargo. |
|||
# It is not intended for manual editing. |
|||
[[package]] |
|||
name = "rust_template" |
|||
version = "0.1.0" |
|||
@ -0,0 +1,9 @@ |
|||
[package] |
|||
name = "rust_template" |
|||
version = "0.1.0" |
|||
authors = ["junikimm717 <68165832+junikimm717@users.noreply.github.com>"] |
|||
edition = "2018" |
|||
|
|||
# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html |
|||
|
|||
[dependencies] |
|||
@ -0,0 +1,28 @@ |
|||
#[allow(unused_imports)]
|
|||
use std::io::{BufWriter, Write, stdin, stdout};
|
|||
|
|||
#[derive(Default)]
|
|||
struct Scanner {
|
|||
buffer: Vec<String>,
|
|||
}
|
|||
|
|||
#[allow(dead_code)]
|
|||
impl Scanner {
|
|||
fn next<T:std::str::FromStr> (&mut self) -> T {
|
|||
loop {
|
|||
if let Some(res) = self.buffer.pop() {
|
|||
return res.parse().ok().expect("fail");
|
|||
}
|
|||
let mut s = String::new();
|
|||
stdin().read_line(&mut s).expect("fail");
|
|||
self.buffer = s.split_whitespace().rev().map(String::from).collect();
|
|||
}
|
|||
}
|
|||
}
|
|||
|
|||
#[allow(unused_variables)]
|
|||
fn main() {
|
|||
let mut sc = Scanner::default();
|
|||
let mut out = BufWriter::new(stdout());
|
|||
|
|||
}
|
|||
@ -0,0 +1,45 @@ |
|||
#!/bin/bash |
|||
PROG="main" |
|||
|
|||
# compilation stage. |
|||
# using sanitizers to prevent dumb buffer overflows. |
|||
cargo build |
|||
if [ $? -ne 0 ]; then |
|||
exit 1 |
|||
fi |
|||
|
|||
# diffing program output against actual output. |
|||
for i in *.in; do |
|||
name=`echo $i|sed "s/.in//"` |
|||
echo -e "running test: $name \n" |
|||
echo -e "INPUT:" |
|||
cat $name.in |
|||
if [ -f $name.res ]; then |
|||
rm $name.res |
|||
fi |
|||
touch $name.res |
|||
timeout 5s ../target/debug/rust_template < $name.in > $name.res |
|||
if [ $? -eq 124 ]; then |
|||
echo -e "time limit exceeded." |
|||
rm -rf $name.res |
|||
exit 1 |
|||
fi |
|||
|
|||
echo -e "\nOUTPUT:" |
|||
# clearing the .res files. |
|||
if [ $? -ne 0 ]; then |
|||
exit 1 |
|||
fi |
|||
|
|||
cat $name.res |
|||
if [ -f $name.out ]; then |
|||
echo -e "ANSWER:" |
|||
cat $name.out |
|||
echo -e "\nDIFF:" |
|||
diff $name.res $name.out |
|||
fi |
|||
echo -e "\n___________________________________" |
|||
echo -e "\n" |
|||
done |
|||
exit 0 |
|||
|
|||
@ -0,0 +1,26 @@ |
|||
#include "bits/stdc++.h"
|
|||
#include "ext/pb_ds/assoc_container.hpp"
|
|||
using namespace std; |
|||
using namespace __gnu_pbds; |
|||
|
|||
typedef long long ll; |
|||
#define all(v) (v).begin(), (v).end()
|
|||
#define read(v) for (auto &x : v) cin >> x;
|
|||
|
|||
int main() { |
|||
ios_base::sync_with_stdio(0); cin.tie(0); |
|||
|
|||
cout << endl; |
|||
return 0; |
|||
} |
|||
/*
|
|||
|
|||
____ _ _ _ _ _ ___ |
|||
/ ___|___ __| | ___ | |__ _ _ | |_ _ _ __ (_) | |/ (_)_ __ ___ |
|||
| | / _ \ / _` |/ _ \ | '_ \| | | | _ | | | | | '_ \| | | ' /| | '_ ` _ |
|||
| |__| (_) | (_| | __/ | |_) | |_| | | |_| | |_| | | | | | | . \| | | | | | | |
|||
\____\___/ \__,_|\___| |_.__/ \__, | \___/ \__,_|_| |_|_| |_|\_\_|_| |_| |_| |
|||
|___/ |
|||
|
|||
|
|||
*/ |
|||
@ -0,0 +1,23 @@ |
|||
CXX=g++ |
|||
CXXFLAGS=-std=c++11 -Wall -Wextra -pedantic -fsanitize=address -fsanitize=undefined -D_GLIBCXX_DEBUG -D DEBUG |
|||
FFLAGS=-std=c++11 -O2 -Wall -Wextra # for fast flags |
|||
PROG=PROB_NAME |
|||
|
|||
header: |
|||
$(CXX) $(CXXFLAGS) bits/stdc++.h |
|||
$(CXX) $(CXXFLAGS) ext/pb_ds/assoc_container.hpp |
|||
.PHONY: header |
|||
|
|||
fast: |
|||
$(CXX) $(FFLAGS) -o Main Main.cpp |
|||
.PHONY:fast |
|||
|
|||
noheader: |
|||
rm -rf bits/stdc++.h.gch |
|||
rm -rf ext/pb_ds/assoc_container.hpp.gch |
|||
.PHONY: noheader |
|||
|
|||
clean: noheader |
|||
rm *.in *.out *.res |
|||
.PHONY: clean |
|||
|
|||
@ -0,0 +1,146 @@ |
|||
// C++ includes used for precompiling -*- C++ -*- |
|||
|
|||
// Copyright (C) 2003-2020 Free Software Foundation, Inc. |
|||
// |
|||
// This file is part of the GNU ISO C++ Library. This library is free |
|||
// software; you can redistribute it and/or modify it under the |
|||
// terms of the GNU General Public License as published by the |
|||
// Free Software Foundation; either version 3, or (at your option) |
|||
// any later version. |
|||
|
|||
// This library is distributed in the hope that it will be useful, |
|||
// but WITHOUT ANY WARRANTY; without even the implied warranty of |
|||
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|||
// GNU General Public License for more details. |
|||
|
|||
// Under Section 7 of GPL version 3, you are granted additional |
|||
// permissions described in the GCC Runtime Library Exception, version |
|||
// 3.1, as published by the Free Software Foundation. |
|||
|
|||
// You should have received a copy of the GNU General Public License and |
|||
// a copy of the GCC Runtime Library Exception along with this program; |
|||
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see |
|||
// <http://www.gnu.org/licenses/>. |
|||
|
|||
/** @file stdc++.h |
|||
* This is an implementation file for a precompiled header. |
|||
*/ |
|||
|
|||
// 17.4.1.2 Headers |
|||
|
|||
// C |
|||
#ifndef _GLIBCXX_NO_ASSERT |
|||
#include <cassert> |
|||
#endif |
|||
#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> |
|||
|
|||
#if __cplusplus >= 201103L |
|||
#include <ccomplex> |
|||
#include <cfenv> |
|||
#include <cinttypes> |
|||
#include <cstdalign> |
|||
#include <cstdbool> |
|||
#include <cstdint> |
|||
#include <ctgmath> |
|||
#include <cuchar> |
|||
#endif |
|||
|
|||
// C++ |
|||
#include <algorithm> |
|||
#include <bitset> |
|||
#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> |
|||
|
|||
#if __cplusplus >= 201103L |
|||
#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> |
|||
#endif |
|||
|
|||
#if __cplusplus >= 201402L |
|||
#include <shared_mutex> |
|||
#endif |
|||
|
|||
#if __cplusplus >= 201703L |
|||
#include <any> |
|||
#include <charconv> |
|||
// #include <execution> |
|||
#include <filesystem> |
|||
#include <optional> |
|||
#include <memory_resource> |
|||
#include <string_view> |
|||
#include <variant> |
|||
#endif |
|||
|
|||
#if __cplusplus > 201703L |
|||
#include <bit> |
|||
#include <compare> |
|||
#include <concepts> |
|||
#include <numbers> |
|||
#include <ranges> |
|||
#include <span> |
|||
#include <stop_token> |
|||
// #include <syncstream> |
|||
#include <version> |
|||
#endif |
|||
@ -0,0 +1,861 @@ |
|||
// -*- C++ -*-
|
|||
|
|||
// Copyright (C) 2005-2020 Free Software Foundation, Inc.
|
|||
//
|
|||
// This file is part of the GNU ISO C++ Library. This library is free
|
|||
// software; you can redistribute it and/or modify it under the terms
|
|||
// of the GNU General Public License as published by the Free Software
|
|||
// Foundation; either version 3, or (at your option) any later
|
|||
// version.
|
|||
|
|||
// This library is distributed in the hope that it will be useful, but
|
|||
// WITHOUT ANY WARRANTY; without even the implied warranty of
|
|||
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|||
// General Public License for more details.
|
|||
|
|||
// Under Section 7 of GPL version 3, you are granted additional
|
|||
// permissions described in the GCC Runtime Library Exception, version
|
|||
// 3.1, as published by the Free Software Foundation.
|
|||
|
|||
// You should have received a copy of the GNU General Public License and
|
|||
// a copy of the GCC Runtime Library Exception along with this program;
|
|||
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
|||
// <http://www.gnu.org/licenses/>.
|
|||
|
|||
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
|
|||
|
|||
// Permission to use, copy, modify, sell, and distribute this software
|
|||
// is hereby granted without fee, provided that the above copyright
|
|||
// notice appears in all copies, and that both that copyright notice
|
|||
// and this permission notice appear in supporting documentation. None
|
|||
// of the above authors, nor IBM Haifa Research Laboratories, make any
|
|||
// representation about the suitability of this software for any
|
|||
// purpose. It is provided "as is" without express or implied
|
|||
// warranty.
|
|||
|
|||
/**
|
|||
* @file assoc_container.hpp |
|||
* Contains associative containers. |
|||
*/ |
|||
|
|||
#ifndef PB_DS_ASSOC_CNTNR_HPP
|
|||
#define PB_DS_ASSOC_CNTNR_HPP
|
|||
|
|||
#include <bits/c++config.h>
|
|||
#include <ext/typelist.h>
|
|||
#include <ext/pb_ds/tag_and_trait.hpp>
|
|||
#include <ext/pb_ds/detail/standard_policies.hpp>
|
|||
#include <ext/pb_ds/detail/container_base_dispatch.hpp>
|
|||
#include <ext/pb_ds/detail/branch_policy/traits.hpp>
|
|||
|
|||
namespace __gnu_pbds |
|||
{ |
|||
/**
|
|||
* @defgroup containers-pbds Containers |
|||
* @ingroup pbds |
|||
* @{ |
|||
*/ |
|||
|
|||
/**
|
|||
* @defgroup hash-based Hash-Based |
|||
* @ingroup containers-pbds |
|||
* @{ |
|||
*/ |
|||
#define PB_DS_HASH_BASE \
|
|||
detail::container_base_dispatch<Key, Mapped, _Alloc, Tag, \ |
|||
typename __gnu_cxx::typelist::append< \ |
|||
typename __gnu_cxx::typelist::create4<Hash_Fn, Eq_Fn, Resize_Policy, \ |
|||
detail::integral_constant<int, Store_Hash> >::type, Policy_Tl>::type>::type |
|||
|
|||
/**
|
|||
* @defgroup hash-detail Base and Policy Classes |
|||
* @ingroup hash-based |
|||
*/ |
|||
|
|||
/**
|
|||
* A hashed container abstraction. |
|||
* |
|||
* @tparam Key Key type. |
|||
* @tparam Mapped Map type. |
|||
* @tparam Hash_Fn Hashing functor. |
|||
* @tparam Eq_Fn Equal functor. |
|||
* @tparam Resize_Policy Resizes hash. |
|||
* @tparam Store_Hash Indicates whether the hash value |
|||
* will be stored along with each key. |
|||
* @tparam Tag Instantiating data structure type, |
|||
* see container_tag. |
|||
* @tparam Policy_TL Policy typelist. |
|||
* @tparam _Alloc Allocator type. |
|||
* |
|||
* Base is dispatched at compile time via Tag, from the following |
|||
* choices: cc_hash_tag, gp_hash_tag, and descendants of basic_hash_tag. |
|||
* |
|||
* Base choices are: detail::cc_ht_map, detail::gp_ht_map |
|||
*/ |
|||
template<typename Key, |
|||
typename Mapped, |
|||
typename Hash_Fn, |
|||
typename Eq_Fn, |
|||
typename Resize_Policy, |
|||
bool Store_Hash, |
|||
typename Tag, |
|||
typename Policy_Tl, |
|||
typename _Alloc> |
|||
class basic_hash_table : public PB_DS_HASH_BASE |
|||
{ |
|||
private: |
|||
typedef typename PB_DS_HASH_BASE base_type; |
|||
|
|||
public: |
|||
virtual |
|||
~basic_hash_table() { } |
|||
|
|||
protected: |
|||
basic_hash_table() { } |
|||
|
|||
basic_hash_table(const basic_hash_table& other) |
|||
: base_type((const base_type&)other) { } |
|||
|
|||
template<typename T0> |
|||
basic_hash_table(T0 t0) : base_type(t0) { } |
|||
|
|||
template<typename T0, typename T1> |
|||
basic_hash_table(T0 t0, T1 t1) : base_type(t0, t1) { } |
|||
|
|||
template<typename T0, typename T1, typename T2> |
|||
basic_hash_table(T0 t0, T1 t1, T2 t2) : base_type(t0, t1, t2) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3> |
|||
basic_hash_table(T0 t0, T1 t1, T2 t2, T3 t3) |
|||
: base_type(t0, t1, t2, t3) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4> |
|||
basic_hash_table(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4) |
|||
: base_type(t0, t1, t2, t3, t4) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4, |
|||
typename T5> |
|||
basic_hash_table(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5) |
|||
: base_type(t0, t1, t2, t3, t4, t5) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4, |
|||
typename T5, typename T6> |
|||
basic_hash_table(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6) |
|||
: base_type(t0, t1, t2, t3, t4, t5, t6) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4, |
|||
typename T5, typename T6, typename T7> |
|||
basic_hash_table(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6, T7 t7) |
|||
: base_type(t0, t1, t2, t3, t4, t5, t6, t7) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4, |
|||
typename T5, typename T6, typename T7, typename T8> |
|||
basic_hash_table(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6, |
|||
T7 t7, T8 t8) |
|||
: base_type(t0, t1, t2, t3, t4, t5, t6, t7, t8) |
|||
{ } |
|||
|
|||
private: |
|||
basic_hash_table& |
|||
operator=(const base_type&); |
|||
}; |
|||
|
|||
#undef PB_DS_HASH_BASE
|
|||
|
|||
|
|||
#define PB_DS_CC_HASH_BASE \
|
|||
basic_hash_table<Key, Mapped, Hash_Fn, Eq_Fn, Resize_Policy, Store_Hash, \ |
|||
cc_hash_tag, \ |
|||
typename __gnu_cxx::typelist::create1<Comb_Hash_Fn>::type, _Alloc> |
|||
|
|||
|
|||
/**
|
|||
* A collision-chaining hash-based associative container. |
|||
* |
|||
* @tparam Key Key type. |
|||
* @tparam Mapped Map type. |
|||
* @tparam Hash_Fn Hashing functor. |
|||
* @tparam Eq_Fn Equal functor. |
|||
* @tparam Comb_Hash_Fn Combining hash functor. |
|||
* If Hash_Fn is not null_type, then this |
|||
* is the ranged-hash functor; otherwise, |
|||
* this is the range-hashing functor. |
|||
* XXX(See Design::Hash-Based Containers::Hash Policies.) |
|||
* @tparam Resize_Policy Resizes hash. |
|||
* @tparam Store_Hash Indicates whether the hash value |
|||
* will be stored along with each key. |
|||
* If Hash_Fn is null_type, then the |
|||
* container will not compile if this |
|||
* value is true |
|||
* @tparam _Alloc Allocator type. |
|||
* |
|||
* Base tag choices are: cc_hash_tag. |
|||
* |
|||
* Base is basic_hash_table. |
|||
*/ |
|||
template<typename Key, |
|||
typename Mapped, |
|||
typename Hash_Fn = typename detail::default_hash_fn<Key>::type, |
|||
typename Eq_Fn = typename detail::default_eq_fn<Key>::type, |
|||
typename Comb_Hash_Fn = detail::default_comb_hash_fn::type, |
|||
typename Resize_Policy = typename detail::default_resize_policy<Comb_Hash_Fn>::type, |
|||
bool Store_Hash = detail::default_store_hash, |
|||
typename _Alloc = std::allocator<char> > |
|||
class cc_hash_table : public PB_DS_CC_HASH_BASE |
|||
{ |
|||
private: |
|||
typedef PB_DS_CC_HASH_BASE base_type; |
|||
|
|||
public: |
|||
typedef cc_hash_tag container_category; |
|||
typedef Hash_Fn hash_fn; |
|||
typedef Eq_Fn eq_fn; |
|||
typedef Resize_Policy resize_policy; |
|||
typedef Comb_Hash_Fn comb_hash_fn; |
|||
|
|||
/// Default constructor.
|
|||
cc_hash_table() { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the Hash_Fn object of the container object.
|
|||
cc_hash_table(const hash_fn& h) |
|||
: base_type(h) { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object, and
|
|||
/// r_eq_fn will be copied by the eq_fn object of the container
|
|||
/// object.
|
|||
cc_hash_table(const hash_fn& h, const eq_fn& e) |
|||
: base_type(h, e) { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object, r_eq_fn
|
|||
/// will be copied by the eq_fn object of the container object,
|
|||
/// and r_comb_hash_fn will be copied by the comb_hash_fn object
|
|||
/// of the container object.
|
|||
cc_hash_table(const hash_fn& h, const eq_fn& e, const comb_hash_fn& ch) |
|||
: base_type(h, e, ch) { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object, r_eq_fn
|
|||
/// will be copied by the eq_fn object of the container object,
|
|||
/// r_comb_hash_fn will be copied by the comb_hash_fn object of
|
|||
/// the container object, and r_resize_policy will be copied by
|
|||
/// the resize_policy object of the container object.
|
|||
cc_hash_table(const hash_fn& h, const eq_fn& e, const comb_hash_fn& ch, |
|||
const resize_policy& rp) |
|||
: base_type(h, e, ch, rp) { } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types. The
|
|||
/// value_types between first_it and last_it will be inserted into
|
|||
/// the container object.
|
|||
template<typename It> |
|||
cc_hash_table(It first, It last) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects. The value_types between first_it and
|
|||
/// last_it will be inserted into the container object.
|
|||
template<typename It> |
|||
cc_hash_table(It first, It last, const hash_fn& h) |
|||
: base_type(h) |
|||
{ this->copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object,
|
|||
/// and r_eq_fn will be copied by the eq_fn object of the
|
|||
/// container object.
|
|||
template<typename It> |
|||
cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e) |
|||
: base_type(h, e) |
|||
{ this->copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object,
|
|||
/// r_eq_fn will be copied by the eq_fn object of the container
|
|||
/// object, and r_comb_hash_fn will be copied by the comb_hash_fn
|
|||
/// object of the container object.
|
|||
template<typename It> |
|||
cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, |
|||
const comb_hash_fn& ch) |
|||
: base_type(h, e, ch) |
|||
{ this->copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object,
|
|||
/// r_eq_fn will be copied by the eq_fn object of the container
|
|||
/// object, r_comb_hash_fn will be copied by the comb_hash_fn
|
|||
/// object of the container object, and r_resize_policy will be
|
|||
/// copied by the resize_policy object of the container object.
|
|||
template<typename It> |
|||
cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, |
|||
const comb_hash_fn& ch, const resize_policy& rp) |
|||
: base_type(h, e, ch, rp) |
|||
{ this->copy_from_range(first, last); } |
|||
|
|||
cc_hash_table(const cc_hash_table& other) |
|||
: base_type((const base_type&)other) |
|||
{ } |
|||
|
|||
virtual |
|||
~cc_hash_table() { } |
|||
|
|||
cc_hash_table& |
|||
operator=(const cc_hash_table& other) |
|||
{ |
|||
if (this != &other) |
|||
{ |
|||
cc_hash_table tmp(other); |
|||
swap(tmp); |
|||
} |
|||
return *this; |
|||
} |
|||
|
|||
void |
|||
swap(cc_hash_table& other) |
|||
{ base_type::swap(other); } |
|||
}; |
|||
|
|||
#undef PB_DS_CC_HASH_BASE
|
|||
|
|||
|
|||
#define PB_DS_GP_HASH_BASE \
|
|||
basic_hash_table<Key, Mapped, Hash_Fn, Eq_Fn, Resize_Policy, Store_Hash, \ |
|||
gp_hash_tag, \ |
|||
typename __gnu_cxx::typelist::create2<Comb_Probe_Fn, Probe_Fn>::type, _Alloc> |
|||
|
|||
|
|||
/**
|
|||
* A general-probing hash-based associative container. |
|||
* |
|||
* @tparam Key Key type. |
|||
* @tparam Mapped Map type. |
|||
* @tparam Hash_Fn Hashing functor. |
|||
* @tparam Eq_Fn Equal functor. |
|||
* @tparam Comb_Probe_Fn Combining probe functor. |
|||
* If Hash_Fn is not null_type, then this |
|||
* is the ranged-probe functor; otherwise, |
|||
* this is the range-hashing functor. |
|||
* XXX See Design::Hash-Based Containers::Hash Policies. |
|||
* @tparam Probe_Fn Probe functor. |
|||
* @tparam Resize_Policy Resizes hash. |
|||
* @tparam Store_Hash Indicates whether the hash value |
|||
* will be stored along with each key. |
|||
* If Hash_Fn is null_type, then the |
|||
* container will not compile if this |
|||
* value is true |
|||
* @tparam _Alloc Allocator type. |
|||
* |
|||
* Base tag choices are: gp_hash_tag. |
|||
* |
|||
* Base is basic_hash_table. |
|||
*/ |
|||
template<typename Key, |
|||
typename Mapped, |
|||
typename Hash_Fn = typename detail::default_hash_fn<Key>::type, |
|||
typename Eq_Fn = typename detail::default_eq_fn<Key>::type, |
|||
typename Comb_Probe_Fn = detail::default_comb_hash_fn::type, |
|||
typename Probe_Fn = typename detail::default_probe_fn<Comb_Probe_Fn>::type, |
|||
typename Resize_Policy = typename detail::default_resize_policy<Comb_Probe_Fn>::type, |
|||
bool Store_Hash = detail::default_store_hash, |
|||
typename _Alloc = std::allocator<char> > |
|||
class gp_hash_table : public PB_DS_GP_HASH_BASE |
|||
{ |
|||
private: |
|||
typedef PB_DS_GP_HASH_BASE base_type; |
|||
|
|||
public: |
|||
typedef gp_hash_tag container_category; |
|||
typedef Hash_Fn hash_fn; |
|||
typedef Eq_Fn eq_fn; |
|||
typedef Comb_Probe_Fn comb_probe_fn; |
|||
typedef Probe_Fn probe_fn; |
|||
typedef Resize_Policy resize_policy; |
|||
|
|||
/// Default constructor.
|
|||
gp_hash_table() { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object.
|
|||
gp_hash_table(const hash_fn& h) |
|||
: base_type(h) { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object, and
|
|||
/// r_eq_fn will be copied by the eq_fn object of the container
|
|||
/// object.
|
|||
gp_hash_table(const hash_fn& h, const eq_fn& e) |
|||
: base_type(h, e) { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object, r_eq_fn
|
|||
/// will be copied by the eq_fn object of the container object,
|
|||
/// and r_comb_probe_fn will be copied by the comb_probe_fn object
|
|||
/// of the container object.
|
|||
gp_hash_table(const hash_fn& h, const eq_fn& e, const comb_probe_fn& cp) |
|||
: base_type(h, e, cp) { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object, r_eq_fn
|
|||
/// will be copied by the eq_fn object of the container object,
|
|||
/// r_comb_probe_fn will be copied by the comb_probe_fn object of
|
|||
/// the container object, and r_probe_fn will be copied by the
|
|||
/// probe_fn object of the container object.
|
|||
gp_hash_table(const hash_fn& h, const eq_fn& e, const comb_probe_fn& cp, |
|||
const probe_fn& p) |
|||
: base_type(h, e, cp, p) { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object, r_eq_fn
|
|||
/// will be copied by the eq_fn object of the container object,
|
|||
/// r_comb_probe_fn will be copied by the comb_probe_fn object of
|
|||
/// the container object, r_probe_fn will be copied by the
|
|||
/// probe_fn object of the container object, and r_resize_policy
|
|||
/// will be copied by the Resize_Policy object of the container
|
|||
/// object.
|
|||
gp_hash_table(const hash_fn& h, const eq_fn& e, const comb_probe_fn& cp, |
|||
const probe_fn& p, const resize_policy& rp) |
|||
: base_type(h, e, cp, p, rp) { } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types. The
|
|||
/// value_types between first_it and last_it will be inserted into
|
|||
/// the container object.
|
|||
template<typename It> |
|||
gp_hash_table(It first, It last) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects. The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object.
|
|||
template<typename It> |
|||
gp_hash_table(It first, It last, const hash_fn& h) |
|||
: base_type(h) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects. The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object,
|
|||
/// and r_eq_fn will be copied by the eq_fn object of the
|
|||
/// container object.
|
|||
template<typename It> |
|||
gp_hash_table(It first, It last, const hash_fn& h, const eq_fn& e) |
|||
: base_type(h, e) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects. The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object,
|
|||
/// r_eq_fn will be copied by the eq_fn object of the container
|
|||
/// object, and r_comb_probe_fn will be copied by the
|
|||
/// comb_probe_fn object of the container object.
|
|||
template<typename It> |
|||
gp_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, |
|||
const comb_probe_fn& cp) |
|||
: base_type(h, e, cp) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects. The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object,
|
|||
/// r_eq_fn will be copied by the eq_fn object of the container
|
|||
/// object, r_comb_probe_fn will be copied by the comb_probe_fn
|
|||
/// object of the container object, and r_probe_fn will be copied
|
|||
/// by the probe_fn object of the container object.
|
|||
template<typename It> |
|||
gp_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, |
|||
const comb_probe_fn& cp, const probe_fn& p) |
|||
: base_type(h, e, cp, p) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects. The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object,
|
|||
/// r_eq_fn will be copied by the eq_fn object of the container
|
|||
/// object, r_comb_probe_fn will be copied by the comb_probe_fn
|
|||
/// object of the container object, r_probe_fn will be copied by
|
|||
/// the probe_fn object of the container object, and
|
|||
/// r_resize_policy will be copied by the resize_policy object of
|
|||
/// the container object.
|
|||
template<typename It> |
|||
gp_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, |
|||
const comb_probe_fn& cp, const probe_fn& p, |
|||
const resize_policy& rp) |
|||
: base_type(h, e, cp, p, rp) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
gp_hash_table(const gp_hash_table& other) |
|||
: base_type((const base_type&)other) |
|||
{ } |
|||
|
|||
virtual |
|||
~gp_hash_table() { } |
|||
|
|||
gp_hash_table& |
|||
operator=(const gp_hash_table& other) |
|||
{ |
|||
if (this != &other) |
|||
{ |
|||
gp_hash_table tmp(other); |
|||
swap(tmp); |
|||
} |
|||
return *this; |
|||
} |
|||
|
|||
void |
|||
swap(gp_hash_table& other) |
|||
{ base_type::swap(other); } |
|||
}; |
|||
//@} hash-based
|
|||
#undef PB_DS_GP_HASH_BASE
|
|||
|
|||
|
|||
/**
|
|||
* @defgroup branch-based Branch-Based |
|||
* @ingroup containers-pbds |
|||
* @{ |
|||
*/ |
|||
#define PB_DS_BRANCH_BASE \
|
|||
detail::container_base_dispatch<Key, Mapped, _Alloc, Tag, Policy_Tl>::type |
|||
|
|||
/**
|
|||
* @defgroup branch-detail Base and Policy Classes |
|||
* @ingroup branch-based |
|||
*/ |
|||
|
|||
/**
|
|||
* A branched, tree-like (tree, trie) container abstraction. |
|||
* |
|||
* @tparam Key Key type. |
|||
* @tparam Mapped Map type. |
|||
* @tparam Tag Instantiating data structure type, |
|||
* see container_tag. |
|||
* @tparam Node_Update Updates nodes, restores invariants. |
|||
* @tparam Policy_TL Policy typelist. |
|||
* @tparam _Alloc Allocator type. |
|||
* |
|||
* Base is dispatched at compile time via Tag, from the following |
|||
* choices: tree_tag, trie_tag, and their descendants. |
|||
* |
|||
* Base choices are: detail::ov_tree_map, detail::rb_tree_map, |
|||
* detail::splay_tree_map, and detail::pat_trie_map. |
|||
*/ |
|||
template<typename Key, typename Mapped, typename Tag, |
|||
typename Node_Update, typename Policy_Tl, typename _Alloc> |
|||
class basic_branch : public PB_DS_BRANCH_BASE |
|||
{ |
|||
private: |
|||
typedef typename PB_DS_BRANCH_BASE base_type; |
|||
|
|||
public: |
|||
typedef Node_Update node_update; |
|||
|
|||
virtual |
|||
~basic_branch() { } |
|||
|
|||
protected: |
|||
basic_branch() { } |
|||
|
|||
basic_branch(const basic_branch& other) |
|||
: base_type((const base_type&)other) { } |
|||
|
|||
template<typename T0> |
|||
basic_branch(T0 t0) : base_type(t0) { } |
|||
|
|||
template<typename T0, typename T1> |
|||
basic_branch(T0 t0, T1 t1) : base_type(t0, t1) { } |
|||
|
|||
template<typename T0, typename T1, typename T2> |
|||
basic_branch(T0 t0, T1 t1, T2 t2) : base_type(t0, t1, t2) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3> |
|||
basic_branch(T0 t0, T1 t1, T2 t2, T3 t3) |
|||
: base_type(t0, t1, t2, t3) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4> |
|||
basic_branch(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4) |
|||
: base_type(t0, t1, t2, t3, t4) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4, |
|||
typename T5> |
|||
basic_branch(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5) |
|||
: base_type(t0, t1, t2, t3, t4, t5) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4, |
|||
typename T5, typename T6> |
|||
basic_branch(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6) |
|||
: base_type(t0, t1, t2, t3, t4, t5, t6) { } |
|||
}; |
|||
#undef PB_DS_BRANCH_BASE
|
|||
|
|||
|
|||
#define PB_DS_TREE_NODE_AND_IT_TRAITS \
|
|||
detail::tree_traits<Key, Mapped,Cmp_Fn,Node_Update,Tag,_Alloc> |
|||
|
|||
#define PB_DS_TREE_BASE \
|
|||
basic_branch<Key,Mapped, Tag, \ |
|||
typename PB_DS_TREE_NODE_AND_IT_TRAITS::node_update, \ |
|||
typename __gnu_cxx::typelist::create2<Cmp_Fn, \ |
|||
PB_DS_TREE_NODE_AND_IT_TRAITS>::type, _Alloc> |
|||
|
|||
|
|||
/**
|
|||
* A tree-based container. |
|||
* |
|||
* @tparam Key Key type. |
|||
* @tparam Mapped Map type. |
|||
* @tparam Cmp_Fn Comparison functor. |
|||
* @tparam Tag Instantiating data structure type, |
|||
* see container_tag. |
|||
* @tparam Node_Update Updates tree internal-nodes, |
|||
* restores invariants when invalidated. |
|||
* XXX See design::tree-based-containers::node invariants. |
|||
* @tparam _Alloc Allocator type. |
|||
* |
|||
* Base tag choices are: ov_tree_tag, rb_tree_tag, splay_tree_tag. |
|||
* |
|||
* Base is basic_branch. |
|||
*/ |
|||
template<typename Key, typename Mapped, typename Cmp_Fn = std::less<Key>, |
|||
typename Tag = rb_tree_tag, |
|||
template<typename Node_CItr, typename Node_Itr, |
|||
typename Cmp_Fn_, typename _Alloc_> |
|||
class Node_Update = null_node_update, |
|||
typename _Alloc = std::allocator<char> > |
|||
class tree : public PB_DS_TREE_BASE |
|||
{ |
|||
private: |
|||
typedef PB_DS_TREE_BASE base_type; |
|||
|
|||
public: |
|||
/// Comparison functor type.
|
|||
typedef Cmp_Fn cmp_fn; |
|||
|
|||
tree() { } |
|||
|
|||
/// Constructor taking some policy objects. r_cmp_fn will be
|
|||
/// copied by the Cmp_Fn object of the container object.
|
|||
tree(const cmp_fn& c) |
|||
: base_type(c) { } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types. The
|
|||
/// value_types between first_it and last_it will be inserted into
|
|||
/// the container object.
|
|||
template<typename It> |
|||
tree(It first, It last) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_cmp_fn
|
|||
/// will be copied by the cmp_fn object of the container object.
|
|||
template<typename It> |
|||
tree(It first, It last, const cmp_fn& c) |
|||
: base_type(c) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
tree(const tree& other) |
|||
: base_type((const base_type&)other) { } |
|||
|
|||
virtual |
|||
~tree() { } |
|||
|
|||
tree& |
|||
operator=(const tree& other) |
|||
{ |
|||
if (this != &other) |
|||
{ |
|||
tree tmp(other); |
|||
swap(tmp); |
|||
} |
|||
return *this; |
|||
} |
|||
|
|||
void |
|||
swap(tree& other) |
|||
{ base_type::swap(other); } |
|||
}; |
|||
|
|||
#undef PB_DS_TREE_BASE
|
|||
#undef PB_DS_TREE_NODE_AND_IT_TRAITS
|
|||
|
|||
|
|||
#define PB_DS_TRIE_NODE_AND_IT_TRAITS \
|
|||
detail::trie_traits<Key,Mapped,_ATraits,Node_Update,Tag,_Alloc> |
|||
|
|||
#define PB_DS_TRIE_BASE \
|
|||
basic_branch<Key,Mapped,Tag, \ |
|||
typename PB_DS_TRIE_NODE_AND_IT_TRAITS::node_update, \ |
|||
typename __gnu_cxx::typelist::create2<_ATraits, \ |
|||
PB_DS_TRIE_NODE_AND_IT_TRAITS >::type, _Alloc> |
|||
|
|||
|
|||
/**
|
|||
* A trie-based container. |
|||
* |
|||
* @tparam Key Key type. |
|||
* @tparam Mapped Map type. |
|||
* @tparam _ATraits Element access traits. |
|||
* @tparam Tag Instantiating data structure type, |
|||
* see container_tag. |
|||
* @tparam Node_Update Updates trie internal-nodes, |
|||
* restores invariants when invalidated. |
|||
* XXX See design::tree-based-containers::node invariants. |
|||
* @tparam _Alloc Allocator type. |
|||
* |
|||
* Base tag choice is pat_trie_tag. |
|||
* |
|||
* Base is basic_branch. |
|||
*/ |
|||
template<typename Key, |
|||
typename Mapped, |
|||
typename _ATraits = \ |
|||
typename detail::default_trie_access_traits<Key>::type, |
|||
typename Tag = pat_trie_tag, |
|||
template<typename Node_CItr, |
|||
typename Node_Itr, |
|||
typename _ATraits_, |
|||
typename _Alloc_> |
|||
class Node_Update = null_node_update, |
|||
typename _Alloc = std::allocator<char> > |
|||
class trie : public PB_DS_TRIE_BASE |
|||
{ |
|||
private: |
|||
typedef PB_DS_TRIE_BASE base_type; |
|||
|
|||
public: |
|||
/// Element access traits type.
|
|||
typedef _ATraits access_traits; |
|||
|
|||
trie() { } |
|||
|
|||
/// Constructor taking some policy objects. r_access_traits will
|
|||
/// be copied by the _ATraits object of the container object.
|
|||
trie(const access_traits& t) |
|||
: base_type(t) { } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types. The
|
|||
/// value_types between first_it and last_it will be inserted into
|
|||
/// the container object.
|
|||
template<typename It> |
|||
trie(It first, It last) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects. The value_types between first_it and
|
|||
/// last_it will be inserted into the container object.
|
|||
template<typename It> |
|||
trie(It first, It last, const access_traits& t) |
|||
: base_type(t) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
trie(const trie& other) |
|||
: base_type((const base_type&)other) { } |
|||
|
|||
virtual |
|||
~trie() { } |
|||
|
|||
trie& |
|||
operator=(const trie& other) |
|||
{ |
|||
if (this != &other) |
|||
{ |
|||
trie tmp(other); |
|||
swap(tmp); |
|||
} |
|||
return *this; |
|||
} |
|||
|
|||
void |
|||
swap(trie& other) |
|||
{ base_type::swap(other); } |
|||
}; |
|||
//@} branch-based
|
|||
#undef PB_DS_TRIE_BASE
|
|||
#undef PB_DS_TRIE_NODE_AND_IT_TRAITS
|
|||
|
|||
|
|||
/**
|
|||
* @defgroup list-based List-Based |
|||
* @ingroup containers-pbds |
|||
* @{ |
|||
*/ |
|||
#define PB_DS_LU_BASE \
|
|||
detail::container_base_dispatch<Key, Mapped, _Alloc, list_update_tag, \ |
|||
typename __gnu_cxx::typelist::create2<Eq_Fn, Update_Policy>::type>::type |
|||
|
|||
|
|||
/**
|
|||
* A list-update based associative container. |
|||
* |
|||
* @tparam Key Key type. |
|||
* @tparam Mapped Map type. |
|||
* @tparam Eq_Fn Equal functor. |
|||
* @tparam Update_Policy Update policy, determines when an element |
|||
* will be moved to the front of the list. |
|||
* @tparam _Alloc Allocator type. |
|||
* |
|||
* Base is detail::lu_map. |
|||
*/ |
|||
template<typename Key, |
|||
typename Mapped, |
|||
class Eq_Fn = typename detail::default_eq_fn<Key>::type, |
|||
class Update_Policy = detail::default_update_policy::type, |
|||
class _Alloc = std::allocator<char> > |
|||
class list_update : public PB_DS_LU_BASE |
|||
{ |
|||
private: |
|||
typedef typename PB_DS_LU_BASE base_type; |
|||
|
|||
public: |
|||
typedef list_update_tag container_category; |
|||
typedef Eq_Fn eq_fn; |
|||
typedef Update_Policy update_policy; |
|||
|
|||
list_update() { } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types. The
|
|||
/// value_types between first_it and last_it will be inserted into
|
|||
/// the container object.
|
|||
template<typename It> |
|||
list_update(It first, It last) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
list_update(const list_update& other) |
|||
: base_type((const base_type&)other) { } |
|||
|
|||
virtual |
|||
~list_update() { } |
|||
|
|||
list_update& |
|||
operator=(const list_update& other) |
|||
{ |
|||
if (this !=& other) |
|||
{ |
|||
list_update tmp(other); |
|||
swap(tmp); |
|||
} |
|||
return *this; |
|||
} |
|||
|
|||
void |
|||
swap(list_update& other) |
|||
{ base_type::swap(other); } |
|||
}; |
|||
//@} list-based
|
|||
#undef PB_DS_LU_BASE
|
|||
|
|||
// @} group containers-pbds
|
|||
} // namespace __gnu_pbds
|
|||
|
|||
#endif
|
|||
@ -0,0 +1 @@ |
|||
This template is a self-io template designed to be used in competitions where you have to submit your own input and output. It takes this directory as input and pipes the output to the output folder. |
|||
@ -0,0 +1 @@ |
|||
This template is a self-io template designed to be used in competitions where you have to submit your own input and output. It takes this directory as input and pipes the output to the output folder. |
|||
@ -0,0 +1,16 @@ |
|||
[ -d input ] || exit 127 |
|||
[ ! -f input/*.in ] && echo "no tests." && exit 127 |
|||
|
|||
make fast || exit 1 |
|||
|
|||
cd input |
|||
for T in *.in; do |
|||
NAME=$(echo $T | sed "s/.in//g") |
|||
timeout 5s ../Main < $NAME.in > ../output/$NAME.txt |
|||
if [ $? -eq 124 ]; then |
|||
echo "TLE" |
|||
exit 124 |
|||
elif [ $? -ne 0 ]; then |
|||
exit 1 |
|||
fi |
|||
done |
|||
@ -0,0 +1,44 @@ |
|||
#!/bin/bash |
|||
PROG="Main" |
|||
|
|||
# compilation stage. |
|||
# using sanitizers to prevent dumb buffer overflows. |
|||
make $PROG |
|||
if [ $? -ne 0 ]; then |
|||
exit 1 |
|||
fi |
|||
|
|||
# diffing program output against actual output. |
|||
for i in *.in; do |
|||
name=`echo $i|sed "s/.in//"` |
|||
echo -e "running test: $name \n" |
|||
echo -e "INPUT:" |
|||
cat $name.in |
|||
|
|||
echo -e "\nOUTPUT:" |
|||
# clearing the .res files. |
|||
if [ -f $name.res ]; then |
|||
rm $name.res |
|||
fi |
|||
touch $name.res |
|||
timeout 5s ./$PROG < $name.in > $name.res |
|||
if [ $? -eq 124 ]; then |
|||
echo -e "time limit exceeded." |
|||
rm -rf $name.res |
|||
exit 1 |
|||
fi |
|||
if [ $? -ne 0 ]; then |
|||
exit 1 |
|||
fi |
|||
|
|||
cat $name.res |
|||
if [ -f $name.out ]; then |
|||
echo -e "ANSWER:" |
|||
cat $name.out |
|||
echo -e "\nDIFF:" |
|||
diff $name.res $name.out |
|||
fi |
|||
echo -e "\n___________________________________" |
|||
echo -e "\n" |
|||
done |
|||
exit 0 |
|||
@ -0,0 +1,23 @@ |
|||
#include "bits/stdc++.h"
|
|||
#include "ext/pb_ds/assoc_container.hpp"
|
|||
using namespace std; |
|||
using namespace __gnu_pbds; |
|||
|
|||
typedef long long ll; |
|||
#define all(v) (v).begin(), (v).end()
|
|||
#define read(v) for (auto &x : v) cin >> x;
|
|||
|
|||
int main() { |
|||
ios_base::sync_with_stdio(0); cin.tie(0); |
|||
|
|||
cout << endl; |
|||
return 0; |
|||
} |
|||
/*
|
|||
____ _ _ _ _ _ ___ |
|||
/ ___|___ __| | ___ | |__ _ _ | |_ _ _ __ (_) | |/ (_)_ __ ___ |
|||
| | / _ \ / _` |/ _ \ | '_ \| | | | _ | | | | | '_ \| | | ' /| | '_ ` _ |
|||
| |__| (_) | (_| | __/ | |_) | |_| | | |_| | |_| | | | | | | . \| | | | | | | |
|||
\____\___/ \__,_|\___| |_.__/ \__, | \___/ \__,_|_| |_|_| |_|\_\_|_| |_| |_| |
|||
|___/ |
|||
*/ |
|||
@ -0,0 +1,21 @@ |
|||
CXX=g++ |
|||
CXXFLAGS=-std=c++11 -Wall -Wextra -pedantic -fsanitize=address -fsanitize=undefined -D_GLIBCXX_DEBUG -D DEBUG |
|||
FFLAGS=-std=c++11 -O2 -Wall -Wextra # for fast flags |
|||
PROG=PROB_NAME |
|||
|
|||
header: |
|||
$(CXX) $(CXXFLAGS) bits/stdc++.h |
|||
$(CXX) $(CXXFLAGS) ext/pb_ds/assoc_container.hpp |
|||
.PHONY: header |
|||
|
|||
noheader: |
|||
[ ! -f bits/stdc++.h.gch ] || rm -rf bits/stdc++.h.gch |
|||
[ ! -f ext/pb_ds/assoc_container.hpp.gch ] || rm -rf ext/pb_ds/assoc_container.hpp.gch |
|||
.PHONY: noheader |
|||
|
|||
clean: noheader |
|||
[ ! -f *.in ] || rm *.in |
|||
[ ! -f *.out ] || rm *.out |
|||
[ ! -f *.res ] || rm *.res |
|||
[ ! -f Main ] || rm Main |
|||
.PHONY: clean |
|||
@ -0,0 +1,146 @@ |
|||
// C++ includes used for precompiling -*- C++ -*- |
|||
|
|||
// Copyright (C) 2003-2020 Free Software Foundation, Inc. |
|||
// |
|||
// This file is part of the GNU ISO C++ Library. This library is free |
|||
// software; you can redistribute it and/or modify it under the |
|||
// terms of the GNU General Public License as published by the |
|||
// Free Software Foundation; either version 3, or (at your option) |
|||
// any later version. |
|||
|
|||
// This library is distributed in the hope that it will be useful, |
|||
// but WITHOUT ANY WARRANTY; without even the implied warranty of |
|||
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|||
// GNU General Public License for more details. |
|||
|
|||
// Under Section 7 of GPL version 3, you are granted additional |
|||
// permissions described in the GCC Runtime Library Exception, version |
|||
// 3.1, as published by the Free Software Foundation. |
|||
|
|||
// You should have received a copy of the GNU General Public License and |
|||
// a copy of the GCC Runtime Library Exception along with this program; |
|||
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see |
|||
// <http://www.gnu.org/licenses/>. |
|||
|
|||
/** @file stdc++.h |
|||
* This is an implementation file for a precompiled header. |
|||
*/ |
|||
|
|||
// 17.4.1.2 Headers |
|||
|
|||
// C |
|||
#ifndef _GLIBCXX_NO_ASSERT |
|||
#include <cassert> |
|||
#endif |
|||
#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> |
|||
|
|||
#if __cplusplus >= 201103L |
|||
#include <ccomplex> |
|||
#include <cfenv> |
|||
#include <cinttypes> |
|||
#include <cstdalign> |
|||
#include <cstdbool> |
|||
#include <cstdint> |
|||
#include <ctgmath> |
|||
#include <cuchar> |
|||
#endif |
|||
|
|||
// C++ |
|||
#include <algorithm> |
|||
#include <bitset> |
|||
#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> |
|||
|
|||
#if __cplusplus >= 201103L |
|||
#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> |
|||
#endif |
|||
|
|||
#if __cplusplus >= 201402L |
|||
#include <shared_mutex> |
|||
#endif |
|||
|
|||
#if __cplusplus >= 201703L |
|||
#include <any> |
|||
#include <charconv> |
|||
// #include <execution> |
|||
#include <filesystem> |
|||
#include <optional> |
|||
#include <memory_resource> |
|||
#include <string_view> |
|||
#include <variant> |
|||
#endif |
|||
|
|||
#if __cplusplus > 201703L |
|||
#include <bit> |
|||
#include <compare> |
|||
#include <concepts> |
|||
#include <numbers> |
|||
#include <ranges> |
|||
#include <span> |
|||
#include <stop_token> |
|||
// #include <syncstream> |
|||
#include <version> |
|||
#endif |
|||
@ -0,0 +1,46 @@ |
|||
#!/usr/bin/env python3 |
|||
import os |
|||
import sys |
|||
import http.server |
|||
import subprocess |
|||
import json |
|||
|
|||
#script to download sample cases. |
|||
|
|||
def listen(*, timeout=None): |
|||
json_data = None |
|||
class CompetitiveCompanionHandler(http.server.BaseHTTPRequestHandler): |
|||
def do_POST(self): |
|||
nonlocal json_data |
|||
json_data = json.load(self.rfile) |
|||
|
|||
with http.server.HTTPServer(('127.0.0.1', 10046), CompetitiveCompanionHandler) as server: |
|||
server.timeout = timeout |
|||
server.handle_request() |
|||
if json_data is None: |
|||
print("failed") |
|||
print(json_data) |
|||
return json_data |
|||
|
|||
def create_tests(): |
|||
prob = listen() |
|||
#prob is a dictionary containing all of json data |
|||
if prob is None: |
|||
return |
|||
cnt = 1 |
|||
for test in prob["tests"]: |
|||
#create a .in and .out file |
|||
name = "Sample" + str(cnt) |
|||
#create new files and write the required cases to there. |
|||
os.system("touch " + name + ".in") |
|||
os.system("touch " + name + ".out") |
|||
|
|||
with open(name + ".in", "w") as inp: |
|||
inp.write(test["input"]) |
|||
|
|||
with open(name + ".out", "w") as op: |
|||
op.write(test["output"]) |
|||
|
|||
cnt += 1 |
|||
|
|||
create_tests() |
|||
@ -0,0 +1,861 @@ |
|||
// -*- C++ -*-
|
|||
|
|||
// Copyright (C) 2005-2020 Free Software Foundation, Inc.
|
|||
//
|
|||
// This file is part of the GNU ISO C++ Library. This library is free
|
|||
// software; you can redistribute it and/or modify it under the terms
|
|||
// of the GNU General Public License as published by the Free Software
|
|||
// Foundation; either version 3, or (at your option) any later
|
|||
// version.
|
|||
|
|||
// This library is distributed in the hope that it will be useful, but
|
|||
// WITHOUT ANY WARRANTY; without even the implied warranty of
|
|||
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|||
// General Public License for more details.
|
|||
|
|||
// Under Section 7 of GPL version 3, you are granted additional
|
|||
// permissions described in the GCC Runtime Library Exception, version
|
|||
// 3.1, as published by the Free Software Foundation.
|
|||
|
|||
// You should have received a copy of the GNU General Public License and
|
|||
// a copy of the GCC Runtime Library Exception along with this program;
|
|||
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
|||
// <http://www.gnu.org/licenses/>.
|
|||
|
|||
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
|
|||
|
|||
// Permission to use, copy, modify, sell, and distribute this software
|
|||
// is hereby granted without fee, provided that the above copyright
|
|||
// notice appears in all copies, and that both that copyright notice
|
|||
// and this permission notice appear in supporting documentation. None
|
|||
// of the above authors, nor IBM Haifa Research Laboratories, make any
|
|||
// representation about the suitability of this software for any
|
|||
// purpose. It is provided "as is" without express or implied
|
|||
// warranty.
|
|||
|
|||
/**
|
|||
* @file assoc_container.hpp |
|||
* Contains associative containers. |
|||
*/ |
|||
|
|||
#ifndef PB_DS_ASSOC_CNTNR_HPP
|
|||
#define PB_DS_ASSOC_CNTNR_HPP
|
|||
|
|||
#include <bits/c++config.h>
|
|||
#include <ext/typelist.h>
|
|||
#include <ext/pb_ds/tag_and_trait.hpp>
|
|||
#include <ext/pb_ds/detail/standard_policies.hpp>
|
|||
#include <ext/pb_ds/detail/container_base_dispatch.hpp>
|
|||
#include <ext/pb_ds/detail/branch_policy/traits.hpp>
|
|||
|
|||
namespace __gnu_pbds |
|||
{ |
|||
/**
|
|||
* @defgroup containers-pbds Containers |
|||
* @ingroup pbds |
|||
* @{ |
|||
*/ |
|||
|
|||
/**
|
|||
* @defgroup hash-based Hash-Based |
|||
* @ingroup containers-pbds |
|||
* @{ |
|||
*/ |
|||
#define PB_DS_HASH_BASE \
|
|||
detail::container_base_dispatch<Key, Mapped, _Alloc, Tag, \ |
|||
typename __gnu_cxx::typelist::append< \ |
|||
typename __gnu_cxx::typelist::create4<Hash_Fn, Eq_Fn, Resize_Policy, \ |
|||
detail::integral_constant<int, Store_Hash> >::type, Policy_Tl>::type>::type |
|||
|
|||
/**
|
|||
* @defgroup hash-detail Base and Policy Classes |
|||
* @ingroup hash-based |
|||
*/ |
|||
|
|||
/**
|
|||
* A hashed container abstraction. |
|||
* |
|||
* @tparam Key Key type. |
|||
* @tparam Mapped Map type. |
|||
* @tparam Hash_Fn Hashing functor. |
|||
* @tparam Eq_Fn Equal functor. |
|||
* @tparam Resize_Policy Resizes hash. |
|||
* @tparam Store_Hash Indicates whether the hash value |
|||
* will be stored along with each key. |
|||
* @tparam Tag Instantiating data structure type, |
|||
* see container_tag. |
|||
* @tparam Policy_TL Policy typelist. |
|||
* @tparam _Alloc Allocator type. |
|||
* |
|||
* Base is dispatched at compile time via Tag, from the following |
|||
* choices: cc_hash_tag, gp_hash_tag, and descendants of basic_hash_tag. |
|||
* |
|||
* Base choices are: detail::cc_ht_map, detail::gp_ht_map |
|||
*/ |
|||
template<typename Key, |
|||
typename Mapped, |
|||
typename Hash_Fn, |
|||
typename Eq_Fn, |
|||
typename Resize_Policy, |
|||
bool Store_Hash, |
|||
typename Tag, |
|||
typename Policy_Tl, |
|||
typename _Alloc> |
|||
class basic_hash_table : public PB_DS_HASH_BASE |
|||
{ |
|||
private: |
|||
typedef typename PB_DS_HASH_BASE base_type; |
|||
|
|||
public: |
|||
virtual |
|||
~basic_hash_table() { } |
|||
|
|||
protected: |
|||
basic_hash_table() { } |
|||
|
|||
basic_hash_table(const basic_hash_table& other) |
|||
: base_type((const base_type&)other) { } |
|||
|
|||
template<typename T0> |
|||
basic_hash_table(T0 t0) : base_type(t0) { } |
|||
|
|||
template<typename T0, typename T1> |
|||
basic_hash_table(T0 t0, T1 t1) : base_type(t0, t1) { } |
|||
|
|||
template<typename T0, typename T1, typename T2> |
|||
basic_hash_table(T0 t0, T1 t1, T2 t2) : base_type(t0, t1, t2) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3> |
|||
basic_hash_table(T0 t0, T1 t1, T2 t2, T3 t3) |
|||
: base_type(t0, t1, t2, t3) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4> |
|||
basic_hash_table(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4) |
|||
: base_type(t0, t1, t2, t3, t4) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4, |
|||
typename T5> |
|||
basic_hash_table(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5) |
|||
: base_type(t0, t1, t2, t3, t4, t5) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4, |
|||
typename T5, typename T6> |
|||
basic_hash_table(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6) |
|||
: base_type(t0, t1, t2, t3, t4, t5, t6) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4, |
|||
typename T5, typename T6, typename T7> |
|||
basic_hash_table(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6, T7 t7) |
|||
: base_type(t0, t1, t2, t3, t4, t5, t6, t7) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4, |
|||
typename T5, typename T6, typename T7, typename T8> |
|||
basic_hash_table(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6, |
|||
T7 t7, T8 t8) |
|||
: base_type(t0, t1, t2, t3, t4, t5, t6, t7, t8) |
|||
{ } |
|||
|
|||
private: |
|||
basic_hash_table& |
|||
operator=(const base_type&); |
|||
}; |
|||
|
|||
#undef PB_DS_HASH_BASE
|
|||
|
|||
|
|||
#define PB_DS_CC_HASH_BASE \
|
|||
basic_hash_table<Key, Mapped, Hash_Fn, Eq_Fn, Resize_Policy, Store_Hash, \ |
|||
cc_hash_tag, \ |
|||
typename __gnu_cxx::typelist::create1<Comb_Hash_Fn>::type, _Alloc> |
|||
|
|||
|
|||
/**
|
|||
* A collision-chaining hash-based associative container. |
|||
* |
|||
* @tparam Key Key type. |
|||
* @tparam Mapped Map type. |
|||
* @tparam Hash_Fn Hashing functor. |
|||
* @tparam Eq_Fn Equal functor. |
|||
* @tparam Comb_Hash_Fn Combining hash functor. |
|||
* If Hash_Fn is not null_type, then this |
|||
* is the ranged-hash functor; otherwise, |
|||
* this is the range-hashing functor. |
|||
* XXX(See Design::Hash-Based Containers::Hash Policies.) |
|||
* @tparam Resize_Policy Resizes hash. |
|||
* @tparam Store_Hash Indicates whether the hash value |
|||
* will be stored along with each key. |
|||
* If Hash_Fn is null_type, then the |
|||
* container will not compile if this |
|||
* value is true |
|||
* @tparam _Alloc Allocator type. |
|||
* |
|||
* Base tag choices are: cc_hash_tag. |
|||
* |
|||
* Base is basic_hash_table. |
|||
*/ |
|||
template<typename Key, |
|||
typename Mapped, |
|||
typename Hash_Fn = typename detail::default_hash_fn<Key>::type, |
|||
typename Eq_Fn = typename detail::default_eq_fn<Key>::type, |
|||
typename Comb_Hash_Fn = detail::default_comb_hash_fn::type, |
|||
typename Resize_Policy = typename detail::default_resize_policy<Comb_Hash_Fn>::type, |
|||
bool Store_Hash = detail::default_store_hash, |
|||
typename _Alloc = std::allocator<char> > |
|||
class cc_hash_table : public PB_DS_CC_HASH_BASE |
|||
{ |
|||
private: |
|||
typedef PB_DS_CC_HASH_BASE base_type; |
|||
|
|||
public: |
|||
typedef cc_hash_tag container_category; |
|||
typedef Hash_Fn hash_fn; |
|||
typedef Eq_Fn eq_fn; |
|||
typedef Resize_Policy resize_policy; |
|||
typedef Comb_Hash_Fn comb_hash_fn; |
|||
|
|||
/// Default constructor.
|
|||
cc_hash_table() { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the Hash_Fn object of the container object.
|
|||
cc_hash_table(const hash_fn& h) |
|||
: base_type(h) { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object, and
|
|||
/// r_eq_fn will be copied by the eq_fn object of the container
|
|||
/// object.
|
|||
cc_hash_table(const hash_fn& h, const eq_fn& e) |
|||
: base_type(h, e) { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object, r_eq_fn
|
|||
/// will be copied by the eq_fn object of the container object,
|
|||
/// and r_comb_hash_fn will be copied by the comb_hash_fn object
|
|||
/// of the container object.
|
|||
cc_hash_table(const hash_fn& h, const eq_fn& e, const comb_hash_fn& ch) |
|||
: base_type(h, e, ch) { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object, r_eq_fn
|
|||
/// will be copied by the eq_fn object of the container object,
|
|||
/// r_comb_hash_fn will be copied by the comb_hash_fn object of
|
|||
/// the container object, and r_resize_policy will be copied by
|
|||
/// the resize_policy object of the container object.
|
|||
cc_hash_table(const hash_fn& h, const eq_fn& e, const comb_hash_fn& ch, |
|||
const resize_policy& rp) |
|||
: base_type(h, e, ch, rp) { } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types. The
|
|||
/// value_types between first_it and last_it will be inserted into
|
|||
/// the container object.
|
|||
template<typename It> |
|||
cc_hash_table(It first, It last) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects. The value_types between first_it and
|
|||
/// last_it will be inserted into the container object.
|
|||
template<typename It> |
|||
cc_hash_table(It first, It last, const hash_fn& h) |
|||
: base_type(h) |
|||
{ this->copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object,
|
|||
/// and r_eq_fn will be copied by the eq_fn object of the
|
|||
/// container object.
|
|||
template<typename It> |
|||
cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e) |
|||
: base_type(h, e) |
|||
{ this->copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object,
|
|||
/// r_eq_fn will be copied by the eq_fn object of the container
|
|||
/// object, and r_comb_hash_fn will be copied by the comb_hash_fn
|
|||
/// object of the container object.
|
|||
template<typename It> |
|||
cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, |
|||
const comb_hash_fn& ch) |
|||
: base_type(h, e, ch) |
|||
{ this->copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object,
|
|||
/// r_eq_fn will be copied by the eq_fn object of the container
|
|||
/// object, r_comb_hash_fn will be copied by the comb_hash_fn
|
|||
/// object of the container object, and r_resize_policy will be
|
|||
/// copied by the resize_policy object of the container object.
|
|||
template<typename It> |
|||
cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, |
|||
const comb_hash_fn& ch, const resize_policy& rp) |
|||
: base_type(h, e, ch, rp) |
|||
{ this->copy_from_range(first, last); } |
|||
|
|||
cc_hash_table(const cc_hash_table& other) |
|||
: base_type((const base_type&)other) |
|||
{ } |
|||
|
|||
virtual |
|||
~cc_hash_table() { } |
|||
|
|||
cc_hash_table& |
|||
operator=(const cc_hash_table& other) |
|||
{ |
|||
if (this != &other) |
|||
{ |
|||
cc_hash_table tmp(other); |
|||
swap(tmp); |
|||
} |
|||
return *this; |
|||
} |
|||
|
|||
void |
|||
swap(cc_hash_table& other) |
|||
{ base_type::swap(other); } |
|||
}; |
|||
|
|||
#undef PB_DS_CC_HASH_BASE
|
|||
|
|||
|
|||
#define PB_DS_GP_HASH_BASE \
|
|||
basic_hash_table<Key, Mapped, Hash_Fn, Eq_Fn, Resize_Policy, Store_Hash, \ |
|||
gp_hash_tag, \ |
|||
typename __gnu_cxx::typelist::create2<Comb_Probe_Fn, Probe_Fn>::type, _Alloc> |
|||
|
|||
|
|||
/**
|
|||
* A general-probing hash-based associative container. |
|||
* |
|||
* @tparam Key Key type. |
|||
* @tparam Mapped Map type. |
|||
* @tparam Hash_Fn Hashing functor. |
|||
* @tparam Eq_Fn Equal functor. |
|||
* @tparam Comb_Probe_Fn Combining probe functor. |
|||
* If Hash_Fn is not null_type, then this |
|||
* is the ranged-probe functor; otherwise, |
|||
* this is the range-hashing functor. |
|||
* XXX See Design::Hash-Based Containers::Hash Policies. |
|||
* @tparam Probe_Fn Probe functor. |
|||
* @tparam Resize_Policy Resizes hash. |
|||
* @tparam Store_Hash Indicates whether the hash value |
|||
* will be stored along with each key. |
|||
* If Hash_Fn is null_type, then the |
|||
* container will not compile if this |
|||
* value is true |
|||
* @tparam _Alloc Allocator type. |
|||
* |
|||
* Base tag choices are: gp_hash_tag. |
|||
* |
|||
* Base is basic_hash_table. |
|||
*/ |
|||
template<typename Key, |
|||
typename Mapped, |
|||
typename Hash_Fn = typename detail::default_hash_fn<Key>::type, |
|||
typename Eq_Fn = typename detail::default_eq_fn<Key>::type, |
|||
typename Comb_Probe_Fn = detail::default_comb_hash_fn::type, |
|||
typename Probe_Fn = typename detail::default_probe_fn<Comb_Probe_Fn>::type, |
|||
typename Resize_Policy = typename detail::default_resize_policy<Comb_Probe_Fn>::type, |
|||
bool Store_Hash = detail::default_store_hash, |
|||
typename _Alloc = std::allocator<char> > |
|||
class gp_hash_table : public PB_DS_GP_HASH_BASE |
|||
{ |
|||
private: |
|||
typedef PB_DS_GP_HASH_BASE base_type; |
|||
|
|||
public: |
|||
typedef gp_hash_tag container_category; |
|||
typedef Hash_Fn hash_fn; |
|||
typedef Eq_Fn eq_fn; |
|||
typedef Comb_Probe_Fn comb_probe_fn; |
|||
typedef Probe_Fn probe_fn; |
|||
typedef Resize_Policy resize_policy; |
|||
|
|||
/// Default constructor.
|
|||
gp_hash_table() { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object.
|
|||
gp_hash_table(const hash_fn& h) |
|||
: base_type(h) { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object, and
|
|||
/// r_eq_fn will be copied by the eq_fn object of the container
|
|||
/// object.
|
|||
gp_hash_table(const hash_fn& h, const eq_fn& e) |
|||
: base_type(h, e) { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object, r_eq_fn
|
|||
/// will be copied by the eq_fn object of the container object,
|
|||
/// and r_comb_probe_fn will be copied by the comb_probe_fn object
|
|||
/// of the container object.
|
|||
gp_hash_table(const hash_fn& h, const eq_fn& e, const comb_probe_fn& cp) |
|||
: base_type(h, e, cp) { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object, r_eq_fn
|
|||
/// will be copied by the eq_fn object of the container object,
|
|||
/// r_comb_probe_fn will be copied by the comb_probe_fn object of
|
|||
/// the container object, and r_probe_fn will be copied by the
|
|||
/// probe_fn object of the container object.
|
|||
gp_hash_table(const hash_fn& h, const eq_fn& e, const comb_probe_fn& cp, |
|||
const probe_fn& p) |
|||
: base_type(h, e, cp, p) { } |
|||
|
|||
/// Constructor taking some policy objects. r_hash_fn will be
|
|||
/// copied by the hash_fn object of the container object, r_eq_fn
|
|||
/// will be copied by the eq_fn object of the container object,
|
|||
/// r_comb_probe_fn will be copied by the comb_probe_fn object of
|
|||
/// the container object, r_probe_fn will be copied by the
|
|||
/// probe_fn object of the container object, and r_resize_policy
|
|||
/// will be copied by the Resize_Policy object of the container
|
|||
/// object.
|
|||
gp_hash_table(const hash_fn& h, const eq_fn& e, const comb_probe_fn& cp, |
|||
const probe_fn& p, const resize_policy& rp) |
|||
: base_type(h, e, cp, p, rp) { } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types. The
|
|||
/// value_types between first_it and last_it will be inserted into
|
|||
/// the container object.
|
|||
template<typename It> |
|||
gp_hash_table(It first, It last) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects. The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object.
|
|||
template<typename It> |
|||
gp_hash_table(It first, It last, const hash_fn& h) |
|||
: base_type(h) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects. The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object,
|
|||
/// and r_eq_fn will be copied by the eq_fn object of the
|
|||
/// container object.
|
|||
template<typename It> |
|||
gp_hash_table(It first, It last, const hash_fn& h, const eq_fn& e) |
|||
: base_type(h, e) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects. The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object,
|
|||
/// r_eq_fn will be copied by the eq_fn object of the container
|
|||
/// object, and r_comb_probe_fn will be copied by the
|
|||
/// comb_probe_fn object of the container object.
|
|||
template<typename It> |
|||
gp_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, |
|||
const comb_probe_fn& cp) |
|||
: base_type(h, e, cp) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects. The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object,
|
|||
/// r_eq_fn will be copied by the eq_fn object of the container
|
|||
/// object, r_comb_probe_fn will be copied by the comb_probe_fn
|
|||
/// object of the container object, and r_probe_fn will be copied
|
|||
/// by the probe_fn object of the container object.
|
|||
template<typename It> |
|||
gp_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, |
|||
const comb_probe_fn& cp, const probe_fn& p) |
|||
: base_type(h, e, cp, p) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects. The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_hash_fn
|
|||
/// will be copied by the hash_fn object of the container object,
|
|||
/// r_eq_fn will be copied by the eq_fn object of the container
|
|||
/// object, r_comb_probe_fn will be copied by the comb_probe_fn
|
|||
/// object of the container object, r_probe_fn will be copied by
|
|||
/// the probe_fn object of the container object, and
|
|||
/// r_resize_policy will be copied by the resize_policy object of
|
|||
/// the container object.
|
|||
template<typename It> |
|||
gp_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, |
|||
const comb_probe_fn& cp, const probe_fn& p, |
|||
const resize_policy& rp) |
|||
: base_type(h, e, cp, p, rp) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
gp_hash_table(const gp_hash_table& other) |
|||
: base_type((const base_type&)other) |
|||
{ } |
|||
|
|||
virtual |
|||
~gp_hash_table() { } |
|||
|
|||
gp_hash_table& |
|||
operator=(const gp_hash_table& other) |
|||
{ |
|||
if (this != &other) |
|||
{ |
|||
gp_hash_table tmp(other); |
|||
swap(tmp); |
|||
} |
|||
return *this; |
|||
} |
|||
|
|||
void |
|||
swap(gp_hash_table& other) |
|||
{ base_type::swap(other); } |
|||
}; |
|||
//@} hash-based
|
|||
#undef PB_DS_GP_HASH_BASE
|
|||
|
|||
|
|||
/**
|
|||
* @defgroup branch-based Branch-Based |
|||
* @ingroup containers-pbds |
|||
* @{ |
|||
*/ |
|||
#define PB_DS_BRANCH_BASE \
|
|||
detail::container_base_dispatch<Key, Mapped, _Alloc, Tag, Policy_Tl>::type |
|||
|
|||
/**
|
|||
* @defgroup branch-detail Base and Policy Classes |
|||
* @ingroup branch-based |
|||
*/ |
|||
|
|||
/**
|
|||
* A branched, tree-like (tree, trie) container abstraction. |
|||
* |
|||
* @tparam Key Key type. |
|||
* @tparam Mapped Map type. |
|||
* @tparam Tag Instantiating data structure type, |
|||
* see container_tag. |
|||
* @tparam Node_Update Updates nodes, restores invariants. |
|||
* @tparam Policy_TL Policy typelist. |
|||
* @tparam _Alloc Allocator type. |
|||
* |
|||
* Base is dispatched at compile time via Tag, from the following |
|||
* choices: tree_tag, trie_tag, and their descendants. |
|||
* |
|||
* Base choices are: detail::ov_tree_map, detail::rb_tree_map, |
|||
* detail::splay_tree_map, and detail::pat_trie_map. |
|||
*/ |
|||
template<typename Key, typename Mapped, typename Tag, |
|||
typename Node_Update, typename Policy_Tl, typename _Alloc> |
|||
class basic_branch : public PB_DS_BRANCH_BASE |
|||
{ |
|||
private: |
|||
typedef typename PB_DS_BRANCH_BASE base_type; |
|||
|
|||
public: |
|||
typedef Node_Update node_update; |
|||
|
|||
virtual |
|||
~basic_branch() { } |
|||
|
|||
protected: |
|||
basic_branch() { } |
|||
|
|||
basic_branch(const basic_branch& other) |
|||
: base_type((const base_type&)other) { } |
|||
|
|||
template<typename T0> |
|||
basic_branch(T0 t0) : base_type(t0) { } |
|||
|
|||
template<typename T0, typename T1> |
|||
basic_branch(T0 t0, T1 t1) : base_type(t0, t1) { } |
|||
|
|||
template<typename T0, typename T1, typename T2> |
|||
basic_branch(T0 t0, T1 t1, T2 t2) : base_type(t0, t1, t2) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3> |
|||
basic_branch(T0 t0, T1 t1, T2 t2, T3 t3) |
|||
: base_type(t0, t1, t2, t3) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4> |
|||
basic_branch(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4) |
|||
: base_type(t0, t1, t2, t3, t4) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4, |
|||
typename T5> |
|||
basic_branch(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5) |
|||
: base_type(t0, t1, t2, t3, t4, t5) { } |
|||
|
|||
template<typename T0, typename T1, typename T2, typename T3, typename T4, |
|||
typename T5, typename T6> |
|||
basic_branch(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6) |
|||
: base_type(t0, t1, t2, t3, t4, t5, t6) { } |
|||
}; |
|||
#undef PB_DS_BRANCH_BASE
|
|||
|
|||
|
|||
#define PB_DS_TREE_NODE_AND_IT_TRAITS \
|
|||
detail::tree_traits<Key, Mapped,Cmp_Fn,Node_Update,Tag,_Alloc> |
|||
|
|||
#define PB_DS_TREE_BASE \
|
|||
basic_branch<Key,Mapped, Tag, \ |
|||
typename PB_DS_TREE_NODE_AND_IT_TRAITS::node_update, \ |
|||
typename __gnu_cxx::typelist::create2<Cmp_Fn, \ |
|||
PB_DS_TREE_NODE_AND_IT_TRAITS>::type, _Alloc> |
|||
|
|||
|
|||
/**
|
|||
* A tree-based container. |
|||
* |
|||
* @tparam Key Key type. |
|||
* @tparam Mapped Map type. |
|||
* @tparam Cmp_Fn Comparison functor. |
|||
* @tparam Tag Instantiating data structure type, |
|||
* see container_tag. |
|||
* @tparam Node_Update Updates tree internal-nodes, |
|||
* restores invariants when invalidated. |
|||
* XXX See design::tree-based-containers::node invariants. |
|||
* @tparam _Alloc Allocator type. |
|||
* |
|||
* Base tag choices are: ov_tree_tag, rb_tree_tag, splay_tree_tag. |
|||
* |
|||
* Base is basic_branch. |
|||
*/ |
|||
template<typename Key, typename Mapped, typename Cmp_Fn = std::less<Key>, |
|||
typename Tag = rb_tree_tag, |
|||
template<typename Node_CItr, typename Node_Itr, |
|||
typename Cmp_Fn_, typename _Alloc_> |
|||
class Node_Update = null_node_update, |
|||
typename _Alloc = std::allocator<char> > |
|||
class tree : public PB_DS_TREE_BASE |
|||
{ |
|||
private: |
|||
typedef PB_DS_TREE_BASE base_type; |
|||
|
|||
public: |
|||
/// Comparison functor type.
|
|||
typedef Cmp_Fn cmp_fn; |
|||
|
|||
tree() { } |
|||
|
|||
/// Constructor taking some policy objects. r_cmp_fn will be
|
|||
/// copied by the Cmp_Fn object of the container object.
|
|||
tree(const cmp_fn& c) |
|||
: base_type(c) { } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types. The
|
|||
/// value_types between first_it and last_it will be inserted into
|
|||
/// the container object.
|
|||
template<typename It> |
|||
tree(It first, It last) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects The value_types between first_it and
|
|||
/// last_it will be inserted into the container object. r_cmp_fn
|
|||
/// will be copied by the cmp_fn object of the container object.
|
|||
template<typename It> |
|||
tree(It first, It last, const cmp_fn& c) |
|||
: base_type(c) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
tree(const tree& other) |
|||
: base_type((const base_type&)other) { } |
|||
|
|||
virtual |
|||
~tree() { } |
|||
|
|||
tree& |
|||
operator=(const tree& other) |
|||
{ |
|||
if (this != &other) |
|||
{ |
|||
tree tmp(other); |
|||
swap(tmp); |
|||
} |
|||
return *this; |
|||
} |
|||
|
|||
void |
|||
swap(tree& other) |
|||
{ base_type::swap(other); } |
|||
}; |
|||
|
|||
#undef PB_DS_TREE_BASE
|
|||
#undef PB_DS_TREE_NODE_AND_IT_TRAITS
|
|||
|
|||
|
|||
#define PB_DS_TRIE_NODE_AND_IT_TRAITS \
|
|||
detail::trie_traits<Key,Mapped,_ATraits,Node_Update,Tag,_Alloc> |
|||
|
|||
#define PB_DS_TRIE_BASE \
|
|||
basic_branch<Key,Mapped,Tag, \ |
|||
typename PB_DS_TRIE_NODE_AND_IT_TRAITS::node_update, \ |
|||
typename __gnu_cxx::typelist::create2<_ATraits, \ |
|||
PB_DS_TRIE_NODE_AND_IT_TRAITS >::type, _Alloc> |
|||
|
|||
|
|||
/**
|
|||
* A trie-based container. |
|||
* |
|||
* @tparam Key Key type. |
|||
* @tparam Mapped Map type. |
|||
* @tparam _ATraits Element access traits. |
|||
* @tparam Tag Instantiating data structure type, |
|||
* see container_tag. |
|||
* @tparam Node_Update Updates trie internal-nodes, |
|||
* restores invariants when invalidated. |
|||
* XXX See design::tree-based-containers::node invariants. |
|||
* @tparam _Alloc Allocator type. |
|||
* |
|||
* Base tag choice is pat_trie_tag. |
|||
* |
|||
* Base is basic_branch. |
|||
*/ |
|||
template<typename Key, |
|||
typename Mapped, |
|||
typename _ATraits = \ |
|||
typename detail::default_trie_access_traits<Key>::type, |
|||
typename Tag = pat_trie_tag, |
|||
template<typename Node_CItr, |
|||
typename Node_Itr, |
|||
typename _ATraits_, |
|||
typename _Alloc_> |
|||
class Node_Update = null_node_update, |
|||
typename _Alloc = std::allocator<char> > |
|||
class trie : public PB_DS_TRIE_BASE |
|||
{ |
|||
private: |
|||
typedef PB_DS_TRIE_BASE base_type; |
|||
|
|||
public: |
|||
/// Element access traits type.
|
|||
typedef _ATraits access_traits; |
|||
|
|||
trie() { } |
|||
|
|||
/// Constructor taking some policy objects. r_access_traits will
|
|||
/// be copied by the _ATraits object of the container object.
|
|||
trie(const access_traits& t) |
|||
: base_type(t) { } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types. The
|
|||
/// value_types between first_it and last_it will be inserted into
|
|||
/// the container object.
|
|||
template<typename It> |
|||
trie(It first, It last) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types and
|
|||
/// some policy objects. The value_types between first_it and
|
|||
/// last_it will be inserted into the container object.
|
|||
template<typename It> |
|||
trie(It first, It last, const access_traits& t) |
|||
: base_type(t) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
trie(const trie& other) |
|||
: base_type((const base_type&)other) { } |
|||
|
|||
virtual |
|||
~trie() { } |
|||
|
|||
trie& |
|||
operator=(const trie& other) |
|||
{ |
|||
if (this != &other) |
|||
{ |
|||
trie tmp(other); |
|||
swap(tmp); |
|||
} |
|||
return *this; |
|||
} |
|||
|
|||
void |
|||
swap(trie& other) |
|||
{ base_type::swap(other); } |
|||
}; |
|||
//@} branch-based
|
|||
#undef PB_DS_TRIE_BASE
|
|||
#undef PB_DS_TRIE_NODE_AND_IT_TRAITS
|
|||
|
|||
|
|||
/**
|
|||
* @defgroup list-based List-Based |
|||
* @ingroup containers-pbds |
|||
* @{ |
|||
*/ |
|||
#define PB_DS_LU_BASE \
|
|||
detail::container_base_dispatch<Key, Mapped, _Alloc, list_update_tag, \ |
|||
typename __gnu_cxx::typelist::create2<Eq_Fn, Update_Policy>::type>::type |
|||
|
|||
|
|||
/**
|
|||
* A list-update based associative container. |
|||
* |
|||
* @tparam Key Key type. |
|||
* @tparam Mapped Map type. |
|||
* @tparam Eq_Fn Equal functor. |
|||
* @tparam Update_Policy Update policy, determines when an element |
|||
* will be moved to the front of the list. |
|||
* @tparam _Alloc Allocator type. |
|||
* |
|||
* Base is detail::lu_map. |
|||
*/ |
|||
template<typename Key, |
|||
typename Mapped, |
|||
class Eq_Fn = typename detail::default_eq_fn<Key>::type, |
|||
class Update_Policy = detail::default_update_policy::type, |
|||
class _Alloc = std::allocator<char> > |
|||
class list_update : public PB_DS_LU_BASE |
|||
{ |
|||
private: |
|||
typedef typename PB_DS_LU_BASE base_type; |
|||
|
|||
public: |
|||
typedef list_update_tag container_category; |
|||
typedef Eq_Fn eq_fn; |
|||
typedef Update_Policy update_policy; |
|||
|
|||
list_update() { } |
|||
|
|||
/// Constructor taking __iterators to a range of value_types. The
|
|||
/// value_types between first_it and last_it will be inserted into
|
|||
/// the container object.
|
|||
template<typename It> |
|||
list_update(It first, It last) |
|||
{ base_type::copy_from_range(first, last); } |
|||
|
|||
list_update(const list_update& other) |
|||
: base_type((const base_type&)other) { } |
|||
|
|||
virtual |
|||
~list_update() { } |
|||
|
|||
list_update& |
|||
operator=(const list_update& other) |
|||
{ |
|||
if (this !=& other) |
|||
{ |
|||
list_update tmp(other); |
|||
swap(tmp); |
|||
} |
|||
return *this; |
|||
} |
|||
|
|||
void |
|||
swap(list_update& other) |
|||
{ base_type::swap(other); } |
|||
}; |
|||
//@} list-based
|
|||
#undef PB_DS_LU_BASE
|
|||
|
|||
// @} group containers-pbds
|
|||
} // namespace __gnu_pbds
|
|||
|
|||
#endif
|
|||
@ -0,0 +1,39 @@ |
|||
#!/bin/bash |
|||
PROG="Main" |
|||
|
|||
[ ! -f *.in ] && echo -e "No input found.\n" && exit 127 |
|||
# compilation stage. |
|||
# using sanitizers to prevent dumb buffer overflows. |
|||
make $PROG || exit 1 |
|||
|
|||
# diffing program output against actual output. |
|||
for i in *.in; do |
|||
NAME=$(echo $i | sed "s/.in//g") |
|||
echo -e "running test: $NAME \n" |
|||
echo -e "INPUT:" |
|||
cat $NAME.in |
|||
|
|||
echo -e "\nOUTPUT:" |
|||
timeout 2s ./$PROG < $NAME.in > $NAME.res |
|||
case $? in |
|||
0) |
|||
;; |
|||
124) |
|||
echo -e "TLE.\n" |
|||
exit 124 |
|||
;; |
|||
*) |
|||
exit * |
|||
;; |
|||
esac |
|||
cat $NAME.res |
|||
if [ -f $NAME.out ]; then |
|||
echo -e "ANSWER:" |
|||
cat $NAME.out |
|||
echo -e "\nDIFF:" |
|||
diff $NAME.res $NAME.out |
|||
fi |
|||
echo -e "\n___________________________________" |
|||
echo -e "\n" |
|||
done |
|||
exit 0 |
|||
Write
Preview
Loading…
Cancel
Save
Reference in new issue