oj.uz

Submission #992675

# Submission time Handle Problem Language Result Execution time Memory
992675 2024-06-05T00:31:16 Z Savu_Stefan_Catalin Prize (CEOI22_prize) C++14
0 / 100
 467 ms 73656 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#define int long long
using namespace std;
const int NMAX=1e6+505;
int cnt,ine[2][NMAX+5],lv[NMAX+5],ar[4*NMAX+505],n,t[2][NMAX+5],cen[2],invine[2][NMAX+5],k,q,T,id[NMAX+5],dp[NMAX+5],rmq[25][NMAX+5],imp[NMAX+5],invid[NMAX+5],rr[2][NMAX+5];
vector <int> v[2][NMAX+5];
pair<pair<int,int>,pair<int,int>> ras[NMAX+5];
void dfs(int nod,int tata,int ind)
{
    ++cnt;
    ine[ind][nod]=cnt;
    if (ind==0) lv[nod]=lv[tata]+1;
    for (int i=0;i<v[ind][nod].size();++i)
    {
        dfs(v[ind][nod][i],nod,ind);
    }
}
void read(int ind)
{
    for (int i=1;i<=n;++i)
    {
        cin>>t[ind][i];
        //if (t[ind][i]==-1) cen[ind]=i;
        //else {v[ind][t[ind][i]].push_back(i);}
    }
    /**cnt=0;
    dfs(cen[ind],0,ind);
    for (int i=1;i<=n;++i)
    {
        invine[ind][ine[ind][i]]=i;
    }**/
}
signed main()
{
    cin>>n>>k>>q>>T;
    read(0);
    read(1);
    for (int i=1;i<=k;++i)
    {
        //imp[i]=invine[0][i];
        imp[i]=i;
        cout<<imp[i]<<" ";
    }
        cout<<'\n';
        cout.flush();
    for (int i=1;i<=k;++i)
    {
        id[i]=imp[i];
    }
    //sort(id+1,id+k+1,cmp);
   /** for (int i=1;i<=k;++i)
    {
        invid[id[i]]=i;
    }**/
    for (int i=1;i<k;++i)
    {
        cout<<"? "<<id[i]<<" "<<id[i+1]<<'\n';
    }
    cout<<"!"<<'\n';
    cout.flush();
    for (int i=1;i<k;++i)
    {
        cin>>ras[i].first.first>>ras[i].first.second>>ras[i].second.first>>ras[i].second.second;
    }
  //  solve0();
//    solve1();
  //  makermq();
    for (int i=1;i<=T;++i)
    {
        int x,y;
        cin>>x>>y;
    //    x=invid[x];
    //    y=invid[y];
     //   if (x>y) swap(x,y);
      //  rr[1][i]=ras[x].second.first+ras[y-1].second.second+((x>=y-1) ? 0 : query(1,k,1,x+1,y-1));
    //    rr[0][i]=dp[x]+dp[y]-2*dp[lca(x,y)];
    }
    for (int i=1;i<=T;++i)
        cout<<0<<" "<<0<<'\n';
    cout.flush();
    return 0;
}

Compilation message

Main.cpp: In function 'void dfs(long long int, long long int, long long int)':
Main.cpp:15:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for (int i=0;i<v[ind][nod].size();++i)
      |                  ~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 409 ms 70184 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 300 ms 72420 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Runtime error 195 ms 68104 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 374 ms 70144 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 467 ms 73656 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -