CSES - UKIEPC 2017

Submission details
Task:	Education
Sender:	KnowYourArchitecture
Submission time:	2017-10-31 20:01:15 +0200
Language:	C++
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.04 s	details
#2	ACCEPTED	0.04 s	details
#3	ACCEPTED	0.04 s	details
#4	ACCEPTED	0.04 s	details
#5	ACCEPTED	0.05 s	details
#6	ACCEPTED	0.06 s	details
#7	ACCEPTED	0.07 s	details
#8	ACCEPTED	0.07 s	details
#9	ACCEPTED	0.05 s	details
#10	ACCEPTED	0.06 s	details
#11	ACCEPTED	0.05 s	details
#12	ACCEPTED	0.05 s	details
#13	ACCEPTED	0.03 s	details
#14	ACCEPTED	0.04 s	details
#15	ACCEPTED	0.04 s	details
#16	ACCEPTED	0.04 s	details
#17	ACCEPTED	0.03 s	details
#18	ACCEPTED	0.06 s	details

Code

#include <bits/stdc++.h>
using namespace std;

int dep[5001];
int rent[5001];
int cap[5001];
int taken[5001];
int asd[5001];

int main() {
  int n, m;
  cin >> n >> m;
  vector<pair<int, int>> deps;
  vector<pair<int, pair<int, int>>> bs;
  for(int i=0;i<n;i++) {
    cin >> dep[i];
    deps.push_back({-dep[i], i});
  }
  for(int i=0;i<m;i++) cin >> cap[i];
  for(int i=0;i<m;i++) cin >> rent[i];
  for(int i=0;i<m;i++) {
    bs.push_back({rent[i], {cap[i], i}});
  }
  sort(bs.begin(), bs.end());
  sort(deps.begin(), deps.end());
  int ndep = 0;
  for(auto dep : deps) {
    int needed = -dep.first;
    for(int i=0;i<m;i++) {
      auto consider = bs[i];
      if(consider.second.first >= needed && !taken[consider.second.second]) {
        taken[consider.second.second] = true;
        asd[dep.second] = consider.second.second;
        ndep++;
        break;
      }
    }
  }
  if(ndep != n) {
    cout << "impossible" << endl;
  } else {
    for(int i=0;i<n;i++) {
      cout << asd[i]+1 << " ";
    } cout << endl;
  }
  return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
`2 3 1 2 2 1 2 1 1 2` view save

correct output
`2 1` view save

user output
`2 1` view save

Test 2

Verdict: ACCEPTED

input
`100 400 405 604 662 507 209 320 336 94...` view save

correct output
`183 205 248 236 150 50 169 42 ...` view save

user output
`183 205 248 236 150 50 169 42 ...` view save

Test 3

Verdict: ACCEPTED

input
`100 400 596 494 947 89 739 940 923 190...` view save

correct output
`296 159 51 231 329 38 47 75 46...` view save

user output
`296 159 51 231 329 38 47 75 46...` view save

Test 4

Verdict: ACCEPTED

input
`100 400 545 934 613 647 534 10 587 305...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 5

Verdict: ACCEPTED

input
`100 4000 314 533 236 932 593 139 397 73...` view save

correct output
`3230 1223 242 3511 2586 1530 1...` view save

user output
`3230 1223 242 3511 2586 1530 1...` view save

Test 6

Verdict: ACCEPTED

input
`100 4000 498 47 243 573 606 538 182 622...` view save

correct output
`505 1476 2870 3282 2624 1889 3...` view save

user output
`505 1693 2870 1177 2624 1889 3...` view save

Test 7

Verdict: ACCEPTED

input
`4000 5000 992 110 627 188 444 785 607 12...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 8

Verdict: ACCEPTED

input
`4000 5000 981 602 417 68 723 17 189 349 ...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 9

Verdict: ACCEPTED

input
`2000 5000 942 801 7 58 865 535 63 925 45...` view save

correct output
`2654 2673 4524 642 3560 4043 3...` view save

user output
`1375 1696 3937 3576 2437 4043 ...` view save

Test 10

Verdict: ACCEPTED

input
`2000 5000 346 342 325 791 867 387 167 43...` view save

correct output
`2155 1691 1107 4196 3676 396 7...` view save

user output
`3343 3359 1973 3461 3676 856 4...` view save

Test 11

Verdict: ACCEPTED

input
`2000 5000 379 181 81 244 67 138 311 763 ...` view save

correct output
`609 2016 34 1828 252 2270 4016...` view save

user output
`2351 1396 2992 3685 4355 4198 ...` view save

Test 12

Verdict: ACCEPTED

input
`2000 5000 699 504 823 38 915 215 167 649...` view save

correct output
`2127 3976 4307 4103 2537 2779 ...` view save

user output
`3912 963 2739 2831 2494 3978 1...` view save

Test 13

Verdict: ACCEPTED

input
`1000 5000 769 231 535 397 155 434 183 71...` view save

correct output
`2149 4078 402 3128 1111 190 40...` view save

user output
`3194 1546 3323 1158 880 190 40...` view save

Test 14

Verdict: ACCEPTED

input
`1000 5000 709 604 503 881 60 756 49 428 ...` view save

correct output
`1871 3716 4183 3032 2328 731 1...` view save

user output
`4578 3716 4183 1495 2328 3233 ...` view save

Test 15

Verdict: ACCEPTED

input
`500 5000 41 585 417 384 533 606 594 601...` view save

correct output
`4475 3687 4699 1002 1733 2047 ...` view save

user output
`4475 3774 4699 126 290 2913 26...` view save

Test 16

Verdict: ACCEPTED

input
`500 5000 812 250 707 106 652 202 79 336...` view save

correct output
`453 2854 3746 2833 2181 4988 2...` view save

user output
`453 1357 3746 3256 2181 4450 2...` view save

Test 17

Verdict: ACCEPTED

input
`500 5000 607 412 339 886 191 583 330 80...` view save

correct output
`4477 2936 2069 2026 4103 1012 ...` view save

user output
`3480 1377 2069 2977 4103 1012 ...` view save

Test 18

Verdict: ACCEPTED

input
`5000 5000 2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

correct output
`4001 4002 4003 4004 4005 4006 ...` view save

user output
`1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

UKIEPC 2017

Education

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Tasks

Submissions (KnowYourArchitecture)