oj.uz

답안 #320251

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
320251 2020-11-08T06:15:32 Z tasfiq4 질문 (CEOI14_question_grader) C++14
0 / 100
 7000 ms 1048 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int > pii;
typedef long long int lld;
#define pi acos(-1)
#define fr(i,m,n) for(i=m;i<n;i++)
#define fu(i,m,n) for(i=m;i>=n;i--)
#define vec vector<int>
#define pb push_back
#define pp pop_back()
#define ft first
#define sd second
#define all(v) v.begin(),v.end()
#define mom(ara) memset(ara,0,sizeof(ara));
#define m1m(ara) memset(ara,-1,sizeof(ara));
#define endl "\n"
#define eps 1.19209e-07

int encode (int n, int x, int y) {
  vec code[1000];
  int mask,i,j,cnt=1;
  fr(mask,0,(1<<12))
  {
  	vec h;
  	fr(i,0,12)
  	{
  		if(mask&(1<<i)) h.pb(i+1);
  	}
  	if(h.size()==6) code[cnt++]=h;
  }
  while(1){
  	fr(j,0,code[y].size())
  	{
  		if(code[x][0]==code[y][j])
  		{
  			code[x].erase(code[x].begin());
  			break;
  		}
  	}
  	if(j==code[y].size()) break;
  }
  return code[x][0];
}
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int > pii;
typedef long long int lld;
#define pi acos(-1)
#define fr(i,m,n) for(i=m;i<n;i++)
#define fu(i,m,n) for(i=m;i>=n;i--)
#define vec vector<int>
#define pb push_back
#define pp pop_back()
#define ft first
#define sd second
#define all(v) v.begin(),v.end()
#define mom(ara) memset(ara,0,sizeof(ara));
#define m1m(ara) memset(ara,-1,sizeof(ara));
#define endl "\n"
#define eps 1.19209e-07
int decode (int n, int q, int h) {
  vec code[1000];
  int mask,i,j,cnt=1;
  fr(mask,0,(1<<12))
  {
  	vec h;
  	fr(i,0,12)
  	{
  		if(mask&(1<<i)) h.pb(i+1);
  	}
  	if(h.size()==6) code[cnt++]=h;
  }
  fr(i,0,code[q].size())
  {
  	if(code[q][i]==h) return 1;
  }
  return 0;
}

Compilation message

encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:6:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 | #define fr(i,m,n) for(i=m;i<n;i++)
......
   32 |    fr(j,0,code[y].size())
      |       ~~~~~~~~~~~~~~~~~~    
encoder.cpp:32:4: note: in expansion of macro 'fr'
   32 |    fr(j,0,code[y].size())
      |    ^~
encoder.cpp:40:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |    if(j==code[y].size()) break;
      |       ~^~~~~~~~~~~~~~~~

decoder.cpp: In function 'int decode(int, int, int)':
decoder.cpp:6:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 | #define fr(i,m,n) for(i=m;i<n;i++)
......
   30 |   fr(i,0,code[q].size())
      |      ~~~~~~~~~~~~~~~~~~     
decoder.cpp:30:3: note: in expansion of macro 'fr'
   30 |   fr(i,0,code[q].size())
      |   ^~
decoder.cpp:20:14: warning: unused variable 'j' [-Wunused-variable]
   20 |   int mask,i,j,cnt=1;
      |              ^

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 7074 ms 744 KB Time limit exceeded
2 Execution timed out 7012 ms 1048 KB Time limit exceeded