oj.uz

Submission #995416

# Submission time Handle Problem Language Result Execution time Memory
995416 2024-06-09T03:55:53 Z 8pete8 Last supper (IOI12_supper) C++17
0 / 100
 28 ms 15828 KB 
#include "advisor.h"
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
using namespace std;
void ComputeAdvice(int *C, int N, int K, int M){
  auto get=[&](int x){for(int i=20;i>=0;i--)if(x&(1<<i))return i;};
  vector<int>v,on(N,0),cur(N,0);
  vector<int>occ[N+1];
  for(int i=0;i<N;i++,C++)v.pb(*C),occ[v.back()].pb(i);
  for(int i=0;i<N;i++)occ[i].pb(N);
  vector<int>have;
  priority_queue<pii>pq;
  for(int i=0;i<K;i++)pq.push({occ[i][0],have.size()}),have.pb(i),on[i]=1;
  if(K<N){
    int mx=get(K);
    int cnt=0;
    for(auto i:v){
      if(on[i])continue;
      int pos=pq.top().s;
      pq.pop();
      on[have[pos]]=0;
      for(int j=0;j<=mx;j++){
        if(pos&(1<<j))WriteAdvice(1);
        else WriteAdvice(0);
      }
      //while(C[i]<occ[i].size()&&occ[i][C[i]]<=cnt)C[i]++;
      pq.push({occ[i][C[i]],pos});
      have[pos]=i;
      on[i]=1;
      cnt++;
    }
  }
  else{
    int mx=get(N);
    int cnt=0;
    for(auto i:v){
      if(on[i])continue;
      int pos=pq.top().s;
      pq.pop();
      on[have[pos]]=0;
      for(int j=0;j<=mx;j++){
        if(have[pos]&(1<<j))WriteAdvice(1);
        else WriteAdvice(0);
      }
      //while(C[i]<occ[i].size()&&occ[i][C[i]]<=cnt)C[i]++;
      pq.push({occ[i][C[i]],pos});
      have[pos]=i;
      on[i]=1;
      cnt++;
    }
  }
}
#include "assistant.h"
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
using namespace std;
void Assist(unsigned char *A, int N, int K, int R){
  vector<int>have;
  auto get2=[&](int x){for(int i=20;i>=0;i--)if(x&(1<<i))return i;};
  vector<int>on(N,0),pos(N,0);
  priority_queue<pii>pq;
  for(int i=0;i<K;i++)have.pb(i),on[i]=1,pos[i]=i;
  if(K<N){
    int mx=get2(K);
    for(int i=0;i<N;i++){
      int x=GetRequest();
      if(on[x])continue;
      int val=0;
      for(int j=0;j<=mx;j++,A++)val+=((1<<j)*(*A));
      PutBack(have[val]);
      on[have[val]]=0;
      have[val]=x;
      on[x]=1;
    }
  }
  else{
    int mx=get2(N);
    for(int i=0;i<N;i++){
      int x=GetRequest();
      if(on[x])continue;
      int val=0;
      for(int j=0;j<=mx;j++,A++)val+=((1<<j)*(*A));
      PutBack(val);
      on[val]=0;
      have[pos[val]]=x;
      pos[x]=pos[val];
      on[x]=1;
    }
  }
}
/*
10 2 20000
4 5 5 3 5 8 3 5 2 2
*/

Compilation message

advisor.cpp:33:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   33 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
advisor.cpp:35:47: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   35 | void ComputeAdvice(int *C, int N, int K, int M){
      |                                               ^
advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:36:21: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   36 |   auto get=[&](int x){for(int i=20;i>=0;i--)if(x&(1<<i))return i;};
      |                     ^
advisor.cpp: In lambda function:
advisor.cpp:36:66: warning: control reaches end of non-void function [-Wreturn-type]
   36 |   auto get=[&](int x){for(int i=20;i>=0;i--)if(x&(1<<i))return i;};
      |                                                                  ^

assistant.cpp:33:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   33 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
assistant.cpp:35:50: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   35 | void Assist(unsigned char *A, int N, int K, int R){
      |                                                  ^
assistant.cpp: In function 'void Assist(unsigned char*, int, int, int)':
assistant.cpp:37:22: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   37 |   auto get2=[&](int x){for(int i=20;i>=0;i--)if(x&(1<<i))return i;};
      |                      ^
assistant.cpp: In lambda function:
assistant.cpp:37:67: warning: control reaches end of non-void function [-Wreturn-type]
   37 |   auto get2=[&](int x){for(int i=20;i>=0;i--)if(x&(1<<i))return i;};
      |                                                                   ^

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 2292 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 24 ms 12744 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 1116 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Runtime error 22 ms 15536 KB Execution killed with signal 11
2 Runtime error 23 ms 15756 KB Execution killed with signal 11
3 Runtime error 28 ms 15704 KB Execution killed with signal 11
4 Runtime error 22 ms 15728 KB Execution killed with signal 11
5 Runtime error 21 ms 15740 KB Execution killed with signal 11
6 Runtime error 24 ms 15820 KB Execution killed with signal 11
7 Runtime error 21 ms 15828 KB Execution killed with signal 11
8 Runtime error 23 ms 15788 KB Execution killed with signal 11
9 Runtime error 23 ms 15824 KB Execution killed with signal 11
10 Runtime error 24 ms 15560 KB Execution killed with signal 11