oj.uz

답안 #995425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
995425 2024-06-09T04:08:53 Z 8pete8 최후의 만찬 (IOI12_supper) C++17
0 / 100
 196 ms 18592 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);
  K=min(K,N);
  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;
  set<pii>pq;
  for(int i=0;i<K;i++)pq.insert({occ[i][0],have.size()}),have.pb(i),on[i]=1;
  int mx=get(K);
  int cnt=0;
  for(auto i:v){
    if(on[i]){
      auto it=pq.lb({occ[i][cur[i]],0});
      int pos=(*it).s;
      pq.erase(it);
      while(cur[i]<occ[i].size()&&occ[i][cur[i]]<=cnt)cur[i]++;
      pq.insert({occ[i][cur[i]],pos});
      continue;
    }
    if(pq.empty())continue;
    int pos=(*prev(pq.end())).s;
    pq.erase(prev(pq.end()));
    on[have[pos]]=0;
    for(int j=0;j<=mx;j++){
      if(pos&(1<<j))WriteAdvice(1);
      else WriteAdvice(0);
    }
    while(cur[i]<occ[i].size()&&occ[i][cur[i]]<=cnt)cur[i]++;
    pq.insert({occ[i][cur[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;
  K=min(K,N);
  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;
  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;
  }
}
/*
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:52:19: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |       while(cur[i]<occ[i].size()&&occ[i][cur[i]]<=cnt)cur[i]++;
advisor.cpp:64:17: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     while(cur[i]<occ[i].size()&&occ[i][cur[i]]<=cnt)cur[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:38:22: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   38 |   auto get2=[&](int x){for(int i=20;i>=0;i--)if(x&(1<<i))return i;};
      |                      ^
assistant.cpp: In lambda function:
assistant.cpp:38:67: warning: control reaches end of non-void function [-Wreturn-type]
   38 |   auto get2=[&](int x){for(int i=20;i>=0;i--)if(x&(1<<i))return i;};
      |                                                                   ^

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 780 KB Output is correct
2 Incorrect 1 ms 792 KB Output isn't correct - not an optimal way
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 2144 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 145 ms 13976 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 1036 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 182 ms 16784 KB Output isn't correct - not an optimal way
2 Incorrect 176 ms 17100 KB Output isn't correct - not an optimal way
3 Incorrect 183 ms 16988 KB Output isn't correct - not an optimal way
4 Incorrect 175 ms 16996 KB Output isn't correct - not an optimal way
5 Incorrect 170 ms 17008 KB Output isn't correct - not an optimal way
6 Incorrect 177 ms 16980 KB Output isn't correct - not an optimal way
7 Incorrect 176 ms 16980 KB Output isn't correct - not an optimal way
8 Incorrect 168 ms 16996 KB Output isn't correct - not an optimal way
9 Incorrect 172 ms 17012 KB Output isn't correct - not an optimal way
10 Incorrect 196 ms 18592 KB Output isn't correct - not an optimal way