oj.uz

Submission #1027479

# Submission time Handle Problem Language Result Execution time Memory
1027479 2024-07-19T06:53:08 Z dozer Gondola (IOI14_gondola) C++14
55 / 100
 27 ms 5304 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n"
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define mid (l + r) / 2
#define LL node * 2
#define RR node * 2 + 1
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define ll long long
#define MAXN 200005


const int modulo = 1e9+7;
const ll INF = 2e18 + 7;


int valid(int n, int inputSeq[])
{
    set<int> s;
    vector<int> v(n, 0);
    for (int i = 0; i < n; i++){
        int curr = inputSeq[i];
        if (curr <= n) v[i] = curr;
        s.insert(curr);
    }

    if (s.size() < n) return 0;
    int todo = -1;
    for (int i = 0; i < n; i++)
        if (v[i] != 0) todo = i;
    if (todo == -1) return 1;
    vector<int> res(n, 0);
    int it = todo, val = v[todo];
    do{
        res[it] = val;
        val++, it++;
        it %= n;
        val = (val - 1) % n + 1;
    }while(it != todo);

    for (int i = 0; i < n; i++)
        if (v[i] != 0 && res[i] != v[i]) return 0;
    return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    vector<int> v(n, 0);
    for (int i = 0; i < n; i++){
        int curr = gondolaSeq[i];
        if (curr <= n) v[i] = curr;
    }

    int todo = -1;
    for (int i = 0; i < n; i++)
        if (v[i] != 0) todo = i;

    vector<int> res(n, 0);
    int it = 0, val = 1;
    if (todo != -1){
        it = todo, val = v[todo];
    }
    if (todo == -1) todo = 0;
    do{
        res[it] = val;
        val++, it++;
        it %= n;
        val = (val - 1) % n + 1;
    }while(it != todo);

    vector<pii> td;
    for (int i = 0; i < n; i++){
        if (v[i] == 0){
            td.pb({gondolaSeq[i], res[i]});
            replacementSeq[gondolaSeq[i] - (n + 1)] = res[i];
        }
    }
    if (td.empty()) return 0;
    sort(td.begin(), td.end());
    pii tmp = td.back();
    
    int last = tmp.nd;
    replacementSeq[tmp.st - (n + 1)] = 0;
    for (int i = n + 1; i <= tmp.st; i++){
        if (replacementSeq[i - (n + 1)] == 0){
            replacementSeq[i - (n + 1)] = last;
            last = i;
        }
    }
    return tmp.st - n;
}

//----------------------

int countReplacement(int n, int inputSeq[])
{
  return -3;
}
/*
int gondolaSequence[100001];
int replacementSequence[250001];

int main()
{
  fileio();
  int i, n, tag;
  int nr; 
  assert(scanf("%d", &tag)==1);
  assert(scanf("%d", &n)==1);
  for(i=0;i< n;i++)
    assert( scanf("%d", &gondolaSequence[i]) ==1);
  
  switch (tag){
  case 1: case 2: case 3:
    printf("%d\n", valid(n, gondolaSequence));
    break;

  case 4: case 5: case 6:
    nr = replacement(n, gondolaSequence, replacementSequence);
    printf("%d ", nr);
    if (nr > 0)
      {
	for (i=0; i<nr-1; i++)
	  printf("%d ", replacementSequence[i]);
	printf("%d\n", replacementSequence[nr-1]);
      }  
    else printf("\n");
    break;

  case 7: case 8: case 9: case 10:
    printf("%d\n",  countReplacement(n, gondolaSequence));  
    break;
  }

  return 0;
}
*/

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:33:18: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |     if (s.size() < n) return 0;
      |         ~~~~~~~~~^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 8 ms 2652 KB Output is correct
7 Correct 20 ms 3932 KB Output is correct
8 Correct 18 ms 4444 KB Output is correct
9 Correct 5 ms 1624 KB Output is correct
10 Correct 22 ms 5212 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 2624 KB Output is correct
7 Correct 20 ms 3928 KB Output is correct
8 Correct 13 ms 4444 KB Output is correct
9 Correct 4 ms 1628 KB Output is correct
10 Correct 19 ms 5212 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 11 ms 2396 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 27 ms 5304 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 396 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 6 ms 1736 KB Output is correct
12 Correct 7 ms 1884 KB Output is correct
13 Correct 10 ms 1628 KB Output is correct
14 Correct 6 ms 1628 KB Output is correct
15 Correct 17 ms 2644 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -