+sub contest_has_problem {
+ my ($contest, $problem) = @_;
+ query('contest_has_problem_sth', $contest, $problem)->flat
+}
+
+sub job_list {
+ my (%args) = @_;
+ $args{page} //= 1;
+ my %where = (
+ maybe contest => $args{contest},
+ maybe owner => $args{owner},
+ maybe problem => $args{problem},
+ maybe result => $args{result},
+ );
+ $where{private} = 0 unless $args{private};
+
+ my $rows = $db->select('job_entry', 'COUNT(*)', \%where)->list;
+ my $pages = int (($rows + JOBS_PER_PAGE - 1) / JOBS_PER_PAGE);
+ my ($stmt, @bind) = $db->abstract->select('job_entry', '*', \%where, {-desc => 'id'});
+ my $jobs = $db->query("$stmt LIMIT " . JOBS_PER_PAGE . ' OFFSET ' . ($args{page} - 1) * JOBS_PER_PAGE, @bind)->hashes;
+ my %ret = (
+ log => add_names $jobs,
+ current_page => $args{page},
+ last_page => $pages,
+ );
+ $ret{previous_page} = $args{page} - 1 if $args{page} - 1;
+ $ret{next_page} = $args{page} + 1 if $args{page} < $pages;
+
+ \%ret;
+}
+
+sub job_entry {
+ my ($id) = @_;
+ my $ret = add_names query(job_entry_sth => $id)->hash;
+ $ret->{results} = decode_json $ret->{results} if $ret->{results};
+ $ret
+}
+
+sub job_full {
+ my ($id) = @_;
+ scalar query(job_full_sth => $id)->hash
+}
+
+sub create_job {
+ my (%args) = @_;
+ $db->update('users', {lastjob => time});
+ purge '/log/';
+ scalar $db->insert('jobs', \%args, {returning => 'id'})->list
+}
+
+sub calc_score {
+ my ($mxscore, $time, $tries, $totaltime) = @_;
+ my $score = $mxscore;
+ $time = 300 if $time > $totaltime; # uncoverable branch true does not happen anymore (only possible if opens are broken)
+ $score = ($totaltime - $time) / $totaltime * $score;
+ $score -= $tries / 10 * $mxscore;
+ $score = $mxscore * 3 / 10 if $score < $mxscore * 3 / 10;
+ int $score + 0.5
+}
+
+sub standings {
+ my ($ct) = @_;
+ $ct = contest_entry $ct;
+
+ my @problems = query(contest_problems_sth => $ct->{id})->flat;
+ my $pblist = problem_list;
+ my %values = query('problem_values_sth')->map;
+
+ my (%scores, %tries, %opens);
+ my $opens = query(opens_sth => $ct->{id});
+ while ($opens->into(my ($problem, $owner, $time))) {
+ $opens{$problem, $owner} = $time;
+ }
+
+ my $jobs = $db->select('job_entry', '*', {contest => $ct->{id}}, 'id');
+
+ while (my $job = $jobs->hash) {
+ my $open = $opens{$job->{problem}, $job->{owner}} // $ct->{start};
+ my $time = $job->{date} - $open;
+ next if $time < 0; # uncoverable branch true job sent before contest is deprecated
+ my $value = $values{$job->{problem}};
+ my $factor = $job->{result} ? 0 : 1;
+ $factor = $1 / 100 if $job->{result_text} =~ /^(\d+ )/s;
+ $scores{$job->{owner}}{$job->{problem}} = int ($factor * calc_score ($value, $time, $tries{$job->{owner}}{$job->{problem}}++, $ct->{stop} - $ct->{start}));
+ }
+
+ my @st = sort { $b->{score} <=> $a->{score} or $a->{user} cmp $b->{user} } map { ## no critic (ProhibitReverseSortBlock)
+ my $user = $_;
+ +{
+ user => $user,
+ user_name => object_name(users => $user),
+ score => sum (values %{$scores{$user}}),
+ scores => [map { $scores{$user}{$_} // '-'} @problems],
+ }
+ } keys %scores;
+
+ $st[0]->{rank} = 1 if @st;
+ $st[$_]->{rank} = $st[$_ - 1]->{rank} + ($st[$_]->{score} < $st[$_ - 1]->{score}) for 1 .. $#st;
+ +{
+ st => \@st,
+ problems => [map { [ $_, object_name(problems => $_)] } @problems],
+ }
+}
+
+sub update_status {
+ my $jobs = $db->select('jobs', 'id,owner,problem,result', {-not_bool => 'private'}, 'id');
+
+ my %hash;
+ while ($jobs->into(my ($id, $owner, $problem, $result))) {
+ $hash{$problem, $owner} = [$id, $result ? 0 : 1];
+ }
+
+ my @problem_statuses = map { [split ($;), @{$hash{$_}} ] } keys %hash;
+
+ my @contest_statuses = map {
+ my $ct = $_;
+ map { [$ct, $_->{user}, $_->{score}, $_->{rank}] } @{standings($ct)->{st}}
+ } $db->select('contests', 'id')->flat;
+
+ $db->begin;
+ $db->delete('problem_status');
+ $db->query('INSERT INTO problem_status (problem,owner,job,solved) VALUES (??)', @$_) for @problem_statuses;
+ $db->delete('contest_status');
+ $db->query('INSERT INTO contest_status (contest,owner,score,rank) VALUES (??)', @$_) for @contest_statuses;
+ $db->commit
+}
+
+sub rerun_job {
+ my ($id) = @_;
+ $db->query(rerun_job_sth => $id);
+ purge '/log/';
+ purge "/log/$id";
+}
+
+my @PURGE_HOSTS = exists $ENV{PURGE_HOSTS} ? split ' ', $ENV{PURGE_HOSTS} : ();
+my $ht = HTTP::Tiny->new;
+
+sub purge {
+ $ht->request(PURGE => "http://$_$_[0]") for @PURGE_HOSTS;
+}
+
+1;
+
+__END__
+
+=encoding utf-8
+
+=head1 NAME
+
+Gruntmaster::Data - Gruntmaster 6000 Online Judge -- database interface and tools
+
+=head1 SYNOPSIS
+
+ my $db = Gruntmaster::Data->connect('dbi:Pg:');
+
+ my $problem = $db->problem('my_problem');
+ $problem->update({timeout => 2.5}); # Set time limit to 2.5 seconds
+ $problem->rerun; # And rerun all jobs for this problem
+
+ # ...
+
+ my $contest = $db->contests->create({ # Create a new contest
+ id => 'my_contest',
+ name => 'My Awesome Contest',
+ start => time + 100,
+ end => time + 1900,
+ });
+ $db->contest_problems->create({ # Add a problem to the contest
+ contest => 'my_contest',
+ problem => 'my_problem',
+ });
+
+ say 'The contest has not started yet' if $contest->is_pending;
+
+ # ...
+
+ my @jobs = $db->jobs->search({contest => 'my_contest', owner => 'MGV'})->all;
+ $_->rerun for @jobs; # Rerun all jobs sent by MGV in my_contest
+
+=head1 DESCRIPTION
+
+Gruntmaster::Data is the interface to the Gruntmaster 6000 database. Read the L<DBIx::Class> documentation for usage information.
+
+In addition to the typical DBIx::Class::Schema methods, this module contains several convenience methods:
+
+=over
+
+=item contests
+
+Equivalent to C<< $schema->resultset('Contest') >>
+
+=item contest_problems
+
+Equivalent to C<< $schema->resultset('ContestProblem') >>
+
+=item jobs
+
+Equivalent to C<< $schema->resultset('Job') >>
+
+=item problems
+
+Equivalent to C<< $schema->resultset('Problem') >>
+
+=item users
+
+Equivalent to C<< $schema->resultset('User') >>
+
+=item contest($id)
+
+Equivalent to C<< $schema->resultset('Contest')->find($id) >>
+
+=item job($id)
+
+Equivalent to C<< $schema->resultset('Job')->find($id) >>
+
+=item problem($id)
+
+Equivalent to C<< $schema->resultset('Problem')->find($id) >>
+
+=item user($id)
+
+Equivalent to C<< $schema->resultset('User')->find($id) >>
+
+=item user_list
+
+Returns a list of users as an arrayref containing hashrefs.
+
+=item user_entry($id)
+
+Returns a hashref with information about the user $id.
+
+=item problem_list([%args])
+
+Returns a list of problems grouped by level. A hashref with levels as keys.
+
+Takes the following arguments:
+
+=over
+
+=item owner
+
+Only show problems owned by this user
+
+=item contest
+
+Only show problems in this contest
+
+=back
+
+=item problem_entry($id, [$contest, $user])
+
+Returns a hashref with information about the problem $id. If $contest and $user are present, problem open data is updated.
+
+=item contest_list([%args])
+
+Returns a list of contests grouped by state. A hashref with the following keys:
+
+=over
+
+=item pending
+
+An arrayref of hashrefs representing pending contests
+
+=item running
+
+An arrayref of hashrefs representing running contests
+
+=item finished
+
+An arrayref of hashrefs representing finished contests
+
+=back
+
+Takes the following arguments:
+
+=over
+
+=item owner
+
+Only show contests owned by this user.
+
+=back
+
+=item contest_entry($id)
+
+Returns a hashref with information about the contest $id.
+
+=item job_list([%args])
+
+Returns a list of jobs as an arrayref containing hashrefs. Takes the following arguments:
+
+=over
+
+=item owner
+
+Only show jobs submitted by this user.
+
+=item contest
+
+Only show jobs submitted in this contest.
+
+=item problem
+
+Only show jobs submitted for this problem.
+
+=item page
+
+Show this page of results. Defaults to 1. Pages have 10 entries, and the first page has the most recent jobs.
+
+=back
+
+=item job_entry($id)
+
+Returns a hashref with information about the job $id.
+
+=back
+
+=head1 AUTHOR
+
+Marius Gavrilescu E<lt>marius@ieval.roE<gt>
+
+=head1 COPYRIGHT AND LICENSE
+
+Copyright (C) 2014 by Marius Gavrilescu
+
+This library is free software; you can redistribute it and/or modify
+it under the same terms as Perl itself, either Perl version 5.18.1 or,
+at your option, any later version of Perl 5 you may have available.
+