# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1115402 | EfeBabagil | Jobs (BOI24_jobs) | C++14 | 2049 ms | 12104 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 <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+5;
const int mod=1e9+7;
int32_t main()
{
int n,s;
cin>>n>>s;
vector<pair<int,int>> jobs(n+1);
vector<pair<int,int>> prof(n+1);
jobs[0]={0,-1};
for(int i=1;i<n+1;i++)
{
int a,b;
cin>>a>>b;
b;
jobs[i]={a,b};
}
for(int i=1;i<n+1;i++)
{
vector<int> vis(n);
pair<int,int> x=jobs[i];
vis[i]=1;
int sum=0;
int mn=0;
int flag=1;
int flag2=1;
//3 2
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |