# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
32023 | chonka | Job Scheduling (CEOI12_jobs) | C++98 | 496 ms | 24956 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<stdio.h>
#include<vector>
#include<queue>
using namespace std ;
#define MAXN 100007
int n , d , m ;
vector < int > v[ MAXN ] ;
vector < int > ans[ MAXN ] ;
int pos[ 10 * MAXN ] ;
int rev[ 10 * MAXN ] ;
bool f ( int x ) {
queue < pair < int , int > > q ;
int i , j , sz ;
for ( i = 1 ; i <= n ; i ++ ) {
sz = v[ i ].size ( ) ;
for ( j = 0 ; j < sz ; j ++ ) {
q.push ( make_pair ( v[ i ][ j ] , i + d ) ) ;
}
ans[ i ].clear ( ) ;
int lft = x ;
while ( lft != 0 && q.empty ( ) == false ) {
pair < int , int > p = q.front ( ) ;
if ( p.second < i ) { return false ; }
lft -- ;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |