Submission #2233313
Source Code Expand
#include <cstdio> #include <cstdlib> #include <iostream> #include <fstream> #include <sstream> #include <set> #include <map> #include <vector> #include <list> #include <algorithm> #include <cstring> #include <cmath> #include <string> #include <queue> #include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic #include <cassert> #include <iomanip> //do setprecision #include <ctime> #include <complex> using namespace std; #define FOR(i,b,e) for(int i=(b);i<(e);++i) #define FORQ(i,b,e) for(int i=(b);i<=(e);++i) #define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i) #define REP(x, n) for(int x = 0; x < (n); ++x) #define ST first #define ND second #define PB push_back #define MP make_pair #define LL long long #define ULL unsigned LL #define LD long double const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342; const int mod=1000000007; int main(){ int n,m,d,dtmp; int one[100100]={},r[30][100100]={}; cin>>n>>m>>dtmp; FORQ(i,1,n)r[0][i]=i; FOR(i,0,m){ int a; cin>>a; swap(r[0][a],r[0][a+1]); } FORQ(i,1,n)one[r[0][i]]=i; //FORQ(i,1,n)cout<<r[i]<<endl; FORQ(i,1,n)r[0][i]=one[i]; FORQ(i,1,n)FOR(j,0,30){ dp[j+1][i]=dp[j][dp[j][i]]; } FORQ(i,1,n){ int now=i; FOR(j,0,30){ if(d&(1<<j)!=0){ now=dp[j][now]; } } cout<<now<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 阿弥陀 |
User | kt_tenel |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1463 Byte |
Status | CE |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:52:3: error: ‘dp’ was not declared in this scope dp[j+1][i]=dp[j][dp[j][i]]; ^ ./Main.cpp:58:9: error: ‘dp’ was not declared in this scope now=dp[j][now]; ^